CF1399bCodeforces Round #661 (Div. 3)

B. Gifts Fixing

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You have nn 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 ii-th gift consists of aiai candies and bibi oranges.

During one move, you can choose some gift 1≤i≤n1≤i≤n and do one of the following operations:

• eat exactly one candy from this gift (decrease aiai by one);
• eat exactly one orange from this gift (decrease bibi by one);
• eat exactly one candy and exactly one orange from this gift (decrease both aiai and bibi by one).

Of course, you can not eat a candy or orange if it's not present in the gift (so neither aiai nor bibi 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: a1=a2=⋯=ana1=a2=⋯=an and b1=b2=⋯=bnb1=b2=⋯=bn (and aiai equals bibi is not necessary).

Your task is to find the minimum number of moves required to equalize all the given gifts.

You have to answer tt independent test cases.

Input

The first line of the input contains one integer tt (1≤t≤10001≤t≤1000) — the number of test cases. Then tt test cases follow.

The first line of the test case contains one integer nn (1≤n≤501≤n≤50) — the number of gifts. The second line of the test case contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109), where aiai is the number of candies in the ii-th gift. The third line of the test case contains nn integers b1,b2,…,bnb1,b2,…,bn (1≤bi≤1091≤bi≤109), where bibi is the number of oranges in the ii-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

Problem - B - Codeforces

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]a=[3,5,6] and b=[2,2,3]b=[2,2,3];
• choose the second gift and eat one candy from it, so a=[3,4,6]a=[3,4,6] and b=[2,2,3]b=[2,2,3];
• choose the second gift and eat one candy from it, so a=[3,3,6]a=[3,3,6] and b=[2,2,3]b=[2,2,3];
• choose the third gift and eat one candy and one orange from it, so a=[3,3,5]a=[3,3,5] and b=[2,2,2]b=[2,2,2];
• choose the third gift and eat one candy from it, so a=[3,3,4]a=[3,3,4] and b=[2,2,2]b=[2,2,2];
• choose the third gift and eat one candy from it, so a=[3,3,3]a=[3,3,3] and b=[2,2,2]b=[2,2,2].

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e7+10;
ll a[N],b[N];
int t,n;
int main()
{
    cin>>t;
    while(t--)
    {
        cin>>n;
        
        ll mina=1e10+10,minb=1e10+10,sum=0;
        for(ll i=0;i<n;i++)
        {
            cin>>a[i];
            mina=min(mina,a[i]);
        }
         for(ll i=0;i<n;i++)
        {
            cin>>b[i];
            minb=min(minb,b[i]);
        }
        for(ll i=0;i<n;i++)
        {
           sum+=max(a[i]-mina,b[i]-minb);
        }
        cout<<sum<<endl;
    }
}

搞了半天我以为数组溢出了，发现mina ，minb初始化太小了，艾玛，说实话，变态鞋底是我第一次吃不下四口的辣条。。。。辣死我了。