16周Gifts Fixing

16周Gifts Fixing

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 ai candies and bi oranges.

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

eat exactly one candy from this gift (decrease ai by one);
eat exactly one orange from this gift (decrease bi by one);
eat exactly one candy and exactly one orange from this gift (decrease both ai and bi by one).
Of course, you can not eat a candy or orange if it’s not present in the gift (so neither ai nor bi 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=⋯=an and b1=b2=⋯=bn (and ai equals bi 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≤t≤1000) — the number of test cases. Then t test cases follow.

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

有如下三种分配方式（可任意选）
1 吃一颗糖果
2 吃一个橘子
2 各吃一个

输入两组数 一组为糖果a[i] 一组为橘子b[j],想要让两组数量一致，且采用这最少的操作次数，已知三种操作这会让糖果、橘子数量减少，所以我们先找出每组最小数，在与每组数分别相减，求出较大值，这样使得每组都为最小值
例如
a[i]={3,5,6}
b[j]={3,2,3}
mina=3;
minb=2;
a[1]-mina=0;
b[1]-minb=1;
为使每组数相同，取较大的值

在这里插入代码片

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
int maxn=1005;
int n,t,i,j;
int a[maxn],b[maxn];
cin>>t;
while(t--)
{
    int mina=0x3f3f3f3f;
    int minb=0x3f3f3f3f;
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    long long int step=0;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>a[i];
        mina=min(mina,a[i]);
    }
     for(i=1;i<=n;i++)
    {
        cin>>b[i];
        minb=min(minb,b[i]);
    }
    for(i=1;i<=n;i++)
    {
        int c=a[i]-mina;
        int d=b[i]-minb;
        step+=max(c,d);
    }
    cout<<step<<endl;
}

}