A13738 | Gifts Fixing
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You have $n$ gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The $i$ -th gift consists of $a_i$ candies and $b_i$ oranges.
During one move, you can choose some gift $1 \le i \le n$ and do one of the following operations:
- eat exactly one candy from this gift (decrease $a_i$ by one);
- eat exactly one orange from this gift (decrease $b_i$ by one);
- eat exactly one candy and exactly one orange from this gift (decrease both $a_i$ and $b_i$ by one).
Of course, you can not eat a candy or orange if it's not present in the gift (so neither $a_i$ nor $b_i$ can become less than zero).
As said above, all gifts should be equal. This means that after some sequence of moves the following two conditions should be satisfied: $a_1 = a_2 = \dots = a_n$ and $b_1 = b_2 = \dots = b_n$ (and $a_i$ equals $b_i$ is not necessary).
Your task is to find the minimum number of moves required to equalize all the given gifts.
You have to answer $t$ independent test cases.
During one move, you can choose some gift $1 \le i \le n$ and do one of the following operations:
- eat exactly one candy from this gift (decrease $a_i$ by one);
- eat exactly one orange from this gift (decrease $b_i$ by one);
- eat exactly one candy and exactly one orange from this gift (decrease both $a_i$ and $b_i$ by one).
Of course, you can not eat a candy or orange if it's not present in the gift (so neither $a_i$ nor $b_i$ can become less than zero).
As said above, all gifts should be equal. This means that after some sequence of moves the following two conditions should be satisfied: $a_1 = a_2 = \dots = a_n$ and $b_1 = b_2 = \dots = b_n$ (and $a_i$ equals $b_i$ is not necessary).
Your task is to find the minimum number of moves required to equalize all the given gifts.
You have to answer $t$ independent test cases.
输入格式
The first line of the input contains one integer $t$ ( $1 \le t \le 1000$ ) — the number of test cases. Then $t$ test cases follow.
The first line of the test case contains one integer $n$ ( $1 \le n \le 50$ ) — the number of gifts. The second line of the test case contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ), where $a_i$ is the number of candies in the $i$ -th gift. The third line of the test case contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_i \le 10^9$ ), where $b_i$ is the number of oranges in the $i$ -th gift.
The first line of the test case contains one integer $n$ ( $1 \le n \le 50$ ) — the number of gifts. The second line of the test case contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 10^9$ ), where $a_i$ is the number of candies in the $i$ -th gift. The third line of the test case contains $n$ integers $b_1, b_2, \dots, b_n$ ( $1 \le b_i \le 10^9$ ), where $b_i$ is the number of oranges in the $i$ -th gift.
输出格式
For each test case, print one integer: the minimum number of moves required to equalize all the given gifts.
输入输出样例
输入 #1
5 3 3 5 6 3 2 3 5 1 2 3 4 5 5 4 3 2 1 3 1 1 1 2 2 2 6 1 1000000000 1000000000 1000000000 1000000000 1000000000 1 1 1 1 1 1 3 10 12 8 7 5 4
输出 #1
6 16 0 4999999995 7
In the first test case of the example, we can perform the following sequence of moves:
- choose the first gift and eat one orange from it, so $a = [3, 5, 6]$ and $b = [2, 2, 3]$ ;
- choose the second gift and eat one candy from it, so $a = [3, 4, 6]$ and $b = [2, 2, 3]$ ;
- choose the second gift and eat one candy from it, so $a = [3, 3, 6]$ and $b = [2, 2, 3]$ ;
- choose the third gift and eat one candy and one orange from it, so $a = [3, 3, 5]$ and $b = [2, 2, 2]$ ;
- choose the third gift and eat one candy from it, so $a = [3, 3, 4]$ and $b = [2, 2, 2]$ ;
- choose the third gift and eat one candy from it, so $a = [3, 3, 3]$ and $b = [2, 2, 2]$ .
- choose the first gift and eat one orange from it, so $a = [3, 5, 6]$ and $b = [2, 2, 3]$ ;
- choose the second gift and eat one candy from it, so $a = [3, 4, 6]$ and $b = [2, 2, 3]$ ;
- choose the second gift and eat one candy from it, so $a = [3, 3, 6]$ and $b = [2, 2, 3]$ ;
- choose the third gift and eat one candy and one orange from it, so $a = [3, 3, 5]$ and $b = [2, 2, 2]$ ;
- choose the third gift and eat one candy from it, so $a = [3, 3, 4]$ and $b = [2, 2, 2]$ ;
- choose the third gift and eat one candy from it, so $a = [3, 3, 3]$ and $b = [2, 2, 2]$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted