module Day1

import Data.String

parsePair : String -> Maybe (Int, Int)
parsePair pair = do
  num1 <- parseInteger (fst p1)
  num2 <- parseInteger (snd p2)
  pure (num1, num2) where
  p1 = span (/= ' ') pair
  p2 = span (== ' ') (snd p1)

parseStr : String -> List (Int, Int)
parseStr str = do
  nums <- lines str
  maybe [] pure (parsePair nums)
  
part1 : (List Int, List Int) -> Int
part1 inp = sum $ zipWith (\x => \y => abs (x - y)) (sort $ fst inp) (sort $ snd inp)

occur : Eq a => Num b => a -> List a -> b
occur x fs = foldr (\y => \r =>  if x == y then r + 1 else r) 0 fs

part2 : (List Int, List Int) -> Int
part2 (l1, l2) = sum $ map (\x => x * (occur x l2)) l1

export
sol1 : String -> String
sol1 = show . part1 . unzip . parseStr

export
sol2 : String -> String
sol2 = show . part2 . unzip . parseStr