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 Ruby (2.3.3) (judge verdict: Wrong Answer)

#Resale
N = gets.chomp.to_i
V = gets.chomp.split(" ").map(&:to_i)
C = gets.chomp.split(" ").map(&:to_i)
X = []
X.push(0)
sum_x = 0
Y = []
Y.push(0)
sum_y = 0
max_ans = 0
for i in 0..V.length-1 do
    X.push(V[i])
    sum_x = sum_x + V[i]
    for j in 1..V.length-1 do
        if i+1 <= j
            X.push(V[i]+V[j])
        end
    end
end
X.push(sum_x)

for i in 0..C.length-1 do
    Y.push(C[i])
    sum_y = sum_y + C[i]
    for j in 1..C.length-1 do
        if i+1 <= j
            Y.push(C[i]+C[j])
        end
    end
end
Y.push(sum_y)

for i in 0..Y.length-1 do
    if max_ans < X[i] - Y[i]
        max_ans = X[i] - Y[i]
    end
end
puts max_ans