-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathB.cpp
55 lines (48 loc) · 739 Bytes
/
B.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mp make_pair
#define pb push_back
void solve(){
// Solve here
int n;
cin>>n;
vector<int> a;
vector<int> b;
ll amin = INT_MAX;
ll bmin = INT_MAX;
for(int i=0;i<n;i++) {
ll x;
cin>>x;
a.pb(x);
if(x<amin) amin = x;
}
for(int i=0;i<n;i++) {
ll x;
cin>>x;
b.pb(x);
if(x<bmin) bmin = x;
}
ll ans = 0;
for(int i=0;i<n;i++) {
a[i] -= amin;
b[i] -= bmin;
ans += max(a[i], b[i]);
}
cout<<ans<<endl;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}