{"raw_statement":[{"iden":"problem statement","content":"There are $N$ gems. The value of the $i$\\-th gem is $V_i$.\nYou will choose some of these gems, possibly all or none, and get them.\nHowever, you need to pay a cost of $C_i$ to get the $i$\\-th gem.\nLet $X$ be the sum of the values of the gems obtained, and $Y$ be the sum of the costs paid.\nFind the maximum possible value of $X-Y$."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N \\leq 20$\n*   $1 \\leq C_i, V_i \\leq 50$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$V_1$ $V_2$ $...$ $V_N$\n$C_1$ $C_2$ $...$ $C_N$"},{"iden":"sample input 1","content":"3\n10 2 5\n6 3 4"},{"iden":"sample output 1","content":"5\n\nIf 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."},{"iden":"sample input 2","content":"4\n13 21 6 19\n11 30 6 15"},{"iden":"sample output 2","content":"6"},{"iden":"sample input 3","content":"1\n1\n50"},{"iden":"sample output 3","content":"0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}