import Control.Applicative
import Control.Monad as M

solve :: [Int] -> [Int] -> Int
solve values costs = sum $ filter (\n -> n > 0) $ subValuesCosts values costs

subValuesCosts :: Num a => [a] -> [a] -> [a]
subValuesCosts [] ys          = map negate ys
subValuesCosts xs []          = xs
subValuesCosts (x:xs) (y:ys)  = (x-y) : subValuesCosts xs ys

main :: IO ()
main = do
  _ <- getLine
  values <- map read . words <$> getLine
  costs <- map read . words <$> getLine
  putStrLn $ show $ solve values costs


