1 import Data.List (sort)
7 let nums = reverse $ sort $ map read $ words line2 :: [Int]
11 solve (x:xs) = minimum diffs
14 diffs = [abs (s - 2 * (sum y)) | y <- ys]
16 powerSet :: [a] -> [[a]]
18 powerSet (x:xs) = powerSet xs ++ map (x:) (powerSet xs)