101251: [AtCoder]ABC125 B - Resale

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

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

Input

题意翻译

### 题目描述 现在有 $N$ 颗宝石,第 $i$ 颗宝石的价值 $V_{i}$ ,挑选第 $i$ 颗宝石的成本为 $C_{i}$ 。你可以从这些宝石中挑选任意颗数的(包括全选和不选)宝石。挑选完宝石后,你就会得到两个值,这些宝石的总价值 $X$ 和获得这些宝石的总成本 $Y$ ,求 $X-Y$ 的最大值。 ### 输入格式 第一行输入一个正整数 $N$ ,表示宝石的个数。 第二行输入$N$个正整数,是这颗宝石的价值$V_i$。 第三行输入$N$个正整数,是获得这颗宝石的成本$C_i$ ### 输出格式 一个整数,$X-Y$的最大值 ### 提示 - 所有输入都是整数。 - $ 1\ \leq\ N\ \leq\ 20 $ - $ 1\ \leq\ C_i,\ V_i\ \leq\ 50 $

加入题单

上一题 下一题 算法标签: