{"problem":{"name":"Resale","description":{"content":"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 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc125_b"},"statements":[{"statement_type":"Markdown","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$.\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq N \\leq 20$\n*   $1 \\leq C_i, V_i \\leq 50$\n\n## Input\n\nInput 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$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc125_b","tags":[],"sample_group":[["3\n10 2 5\n6 3 4","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."],["4\n13 21 6 19\n11 30 6 15","6"],["1\n1\n50","0"]],"created_at":"2026-03-03 11:01:14"}}