显示原始代码
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int t, n, ans;
long a[N], b[N];
int cnt(int len) {
int oup = 0;
for (int i = 1; i <= len; i++) {
if (a[i] > b[i])
oup += a[i] - b[i];
else
oup += b[i] - a[i];
}
return oup;
}
int main() {
scanf("%d", &t);
for (int i = 1; i <= t; i++) {
scanf("%d", &n);
for (int j = 1; j <= n; j++) scanf("%d", &a[j]);
for (int j = 1; j <= n; j++) scanf("%d", &b[j]);
ans = 0;
ans = max(ans, cnt(n));
for (int j = 1; j < n; j++) {
for (int k = j + 1; k <= n; k++) {
long temp = b[j];
b[j] = b[k];
b[k] = temp;
ans = max(ans, cnt(n));
}
}
printf("%d\n", ans);
}
return 0;
}