hdu1052 Tian Ji -- The Horse Racing

#include<bits/stdc++.h>
using namespace std;
bool compare(int a,int b) {
	return a>b;
}
int main()
{
	int a[1000],b[1000];
	int n,i,j,sum;
	while(scanf("%d",&n)!=EOF&&n!=0) {
		sum=0;
		for(i=0;i<n;i++)
			scanf("%d ",&a[i]);
		sort(a,a+n,compare);
		for(i=0;i<n;i++)
			scanf("%d ",&b[i]);
		sort(b,b+n,compare);
		int tb=0,te=n-1;
		int kb=0,ke=n-1;
		while(tb<=te) {
			if(a[tb]>b[kb]) sum++,tb++,kb++;
			else if(a[te]>b[ke]) sum++,te--,ke--;
			else if(a[te]<b[kb]) sum--,te--,kb++;
			else {
				tb++;
				kb++;
			}
			}
		printf("%d\n",sum*200);
		}

	return 0;
 }