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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();//データの数 
		int V[] = new int[N]; //配列数を決定
		int C[] = new int[N]; //配列数を決定
		int ans[] = new int[N]; //配列数を決定
		
		for(int i = 0; i<N; i++) {
			V[i] = sc.nextInt(); //配列の中身を挿入
			
		}
		
		for(int i = 0; i<N; i++) {
            C[i] = sc.nextInt(); //配列の中身を挿入
		}
		
		for(int i = 0; i<N; i++) {
            ans[i]=V[i]-C[i]; 
		}
		// int配列をInteger配列にコピー(キャスト)
		Integer[] ans1 = new Integer[ ans.length ];
		for ( int i = 0; i < ans.length; ++ i ) {
		    ans1[i] = ans[i];
		 		}
		 	// 降順ソート
		Arrays.sort( ans1, Collections.reverseOrder() );
		
		// Integer配列をint配列にコピー(再キャスト)
		for ( int i = 0; i < ans1.length; ++ i ) {
		 	ans[i] = ans1[i];
		}
		 // 配列の中身を表示
		//for ( int i = 0; i < ans.length; ++ i ) {
		// 	System.out.println(ans[i]);
		//}
		if(ans[0]>=0) {
		System.out.println(ans[0]+ans[1]);
		}else {
			System.out.println(0);
		}
	}
	
}