题解

#include<bits/stdc++.h>
using namespace std;
bool cmp(int x, int y) {
return x > y;
}
int main() {
int n;
cin >> n;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
scanf("%d", &b[i]);
}
sort(a + 1, a + n + 1);
sort(b + 1, b + n + 1);
int cnt = 1, sum = 0;
for (int i = 1; i <= n; i++) {
if (a[i] > b[cnt]) {
sum++;
cnt++;
}
}
cnt = 1;
for (int i = 1; i <= n; i++) {
if (a[i] < b[cnt]) {
sum--;
} else cnt++;
}
cout << sum * 200 << endl;
return 0;
}