atcoder#ABC125B. [ABC125B] Resale

[ABC125B] Resale

Score : 200200 points

Problem Statement

There are NN gems. The value of the ii-th gem is ViV_i.

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

However, you need to pay a cost of CiC_i to get the ii-th gem.

Let XX be the sum of the values of the gems obtained, and YY be the sum of the costs paid.

Find the maximum possible value of XYX-Y.

Constraints

  • All values in input are integers.
  • 1N201 \leq N \leq 20
  • 1Ci,Vi501 \leq C_i, V_i \leq 50

Input

Input is given from Standard Input in the following format:

NN

V1V_1 V2V_2 ...... VNV_N

C1C_1 C2C_2 ...... CNC_N

Output

Print the maximum possible value of XYX-Y.

3
10 2 5
6 3 4
5

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

4
13 21 6 19
11 30 6 15
6
1
1
50
0