Problem:
Score : 200 points

Problem Statement

There are N gems. The value of the i-th gem is V_i.

You will choose some of these gems, possibly all or none, and get them.

However, you need to pay a cost of C_i to get the i-th gem.

Let X be the sum of the values of the gems obtained, and Y be the sum of the costs paid.

Find the maximum possible value of X-Y.

Constraints

All values in input are integers.

1 \leq N \leq 20

1 \leq C_i, V_i \leq 50

Input

Input is given from Standard Input in the following format:

N
V_1 V_2 ... V_N
C_1 C_2 ... C_N

Output

Print the maximum possible value of X-Y.

Sample Input 1

3
10 2 5
6 3 4

Sample Output 1

5

If we choose the first and third gems, X = 10 + 5 = 15 and Y = 6 + 4 = 10.
We have X-Y = 5 here, which is the maximum possible value.

Sample Input 2

4
13 21 6 19
11 30 6 15

Sample Output 2

6

Sample Input 3

1
1
50

Sample Output 3

0

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.IO;

namespace contest
{
    class Program
    {
        static void Main(string[] args)
        {
            solve_abc125_b();
        }

        //Скорее всего можно решить за константу.
        public static void solve_abc125_a()
        {
            string[] abt = Console.ReadLine().Split(' ');
            int a = Convert.ToInt32(abt[0]);
            int b = Convert.ToInt32(abt[1]);
            int c = Convert.ToInt32(abt[2]);

            int count = 0;
            int i = 1;
            while (i * a <= c)
            {
                count += b;
                i++;
            }

            Console.WriteLine(count);
        }

        /*
        Перый подход найти два числа такие, чтобы разность
        суммы ценностей и суммы цен была максимальной неверен. 
        Невнимательно прочитал задание. Там сказано, что можно взять
        несколько или не брать вообще. Может быть не ровно два. 
        */
        public static void solve_abc125_b()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            string[] values = Console.ReadLine().Split(' ');
            string[] costs  = Console.ReadLine().Split(' ');

            int max = 0;
            for (int i = 0; i < values.Length; i++)
            {
                max = Math.Max(max, max + Convert.ToInt32(values[i]) - Convert.ToInt32(costs[i]));
            }

            Console.WriteLine(max);
        }
    }
}