-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1921D Very Different Array.cpp
51 lines (46 loc) · 1.1 KB
/
1921D Very Different Array.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
/*
author : MishkatIT
created : Tuesday 2024-01-16-19.52.34
*/
#include<bits/stdc++.h>
#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define debug(_) cout << #_ << " is " << _ << '\n';
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 10;
const ll inf = 1e9;
const ll linf = 1e18;
int main()
{
fio;
int t;
cin >> t;
while (t--) {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (auto& i : a) cin >> i;
vector<int> b(m);
for (auto& i : b) cin >> i;
sort(a.begin(), a.end());
sort(b.rbegin(), b.rend());
int al = 0, bl = 0, ar = n - 1, br = m - 1;
ll sum = 0;
while(al <= ar) {
int x = abs(a[al] - b[bl]);
int y = abs(a[ar] - b[br]);
sum += max(x, y);
if (x > y) {
al++;
bl++;
} else {
ar--;
br--;
}
}
cout << sum << '\n';
}
return 0;
}