Implementation of subset sum problem using dynamic programming approach in C#.

SubsetSum.cs

public static bool SubsetSum(IEnumerable<int> list, int s) 
{
    var arr = list.ToArray();
    Array.Sort(arr);
    var a = arr.Where(i => i < 0).Sum();
    var b = arr.Where(i => i > 0).Sum();
    if(a > s || b < s)
    {
        return false;
    }
    var dp = new bool[arr.Length+1, s+1];
    for (int i = 0; i <= s; i++)
    {
        dp[0, i] = false;
    }
    for (int j = 1; j <= s; j++)
    {
        for (int i = 1; i <= arr.Length; i++)
        {
            dp[i, j] = (arr[i - 1] == j) || dp[i - 1, j] ||
                ((j - arr[i - 1] >= arr.Take(i).Where(number => number < 0).Sum())
                && (j - arr[i - 1] <= arr.Take(i).Where(number => number > 0).Sum()) 
                && dp[i - 1, j - arr[i - 1]]);
        }
    }
    return dp[arr.Length, s];
}

any better solution for handling float values?