田忌赛马

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 1010;

int a[N], b[N];
int n;

int main() {

    while(cin >> n, n) {
        for(int i = 0; i < n; i++) scanf("%d", &a[i]);
        for(int i = 0; i < n; i++) scanf("%d", &b[i]);
        sort(a, a + n); sort(b, b + n);

        int res = 0;
        int l1 = 0, l2 = 0, r1 = n -1, r2 = n - 1;
        while(l1 <= r1) {
            if(a[r1] < b[r2]) r2--, l1++, res -= 200;
            else if(a[r1] > b[r2]) r1--, r2--, res += 200;
            else {
                if(a[l1] < b[l2]) r2--, l1++, res -= 200;
                else if(a[l1] > b[l2]) l1++, l2++, res += 200;
                else {
                    res += (a[l1] == b[r2] ? 0 : -200);
                    l1++, r2--;
                }
            }
        }
        printf("%d\n", res);
    }

    return 0;
}
/*
作者：yxc
链接：https://www.acwing.com/activity/content/code/content/245685/
来源：AcWing
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。
*/