Codeforcess solution 1399-B B. Gifts Fixing ,C++, Java, Js and Python

Algorithm

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 \leq i \leq 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.

Input

The first line of the input contains one integer $t$ ( $1 \leq t \leq 1000$ ) — the number of test cases. Then $t$ test cases follow.

The first line of the test case contains one integer $n$ ( $1 \leq n \leq 50$ ) — the number of gifts. The second line of the test case contains $n$ integers $a_{1}, a_{2}, \dots, a_{n}$ ( $1 \leq a_{i} \leq 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 \leq b_{i} \leq 10^{9}$ ), where $b_{i}$ is the number of oranges in the $i$ -th gift.

Output

For each test case, print one integer: the minimum number of moves required to equalize all the given gifts.

Example
input
Copy
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
output
Copy
6
16
0
4999999995
7

Note

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]$ .

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int t;
	cin >> t;
	while(t--)
	{
    int n;
		cin >> n;
    int a[n], b[n];
		int mina = 0x3f3f3f3f, minb = 0x3f3f3f3f;
		long long ans = 0;
		for(int i = 1; i <= n; i++)
		{
			cin >> a[i];
			mina = min(mina, a[i]);
		}
		for(int i = 1; i <= n; i++)
		{
			cin >> b[i];
			minb = min(minb, b[i]);
		}
		for(int i = 1; i <= n; i++)
		{
			ans += 1ll * max(a[i] - mina, b[i] - minb);
		}
		cout << ans << endl;
	}
	return 0;
}

Copy The Code & Try With Live Editor

Input

–

cmd

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

Output

–

cmd

6
16
0
4999999995
7

Demonstration

Codeforcess solution 1399-B B. Gifts Fixing ,C++, Java, Js and Python,1399-B,Codeforcess solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution

Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+

Try With Live Editor

Category - Codeforces Online Judge Maniruzzaman Akash 1 year ago 376 0