hdu 1052

Tian Ji – The Horse Racing

#include<bits/stdc++.h>
using namespace std; 
#define a 1008
bool cmp(int x,int y){
	return x>y;
}
int main()
{
	int n,t[a],k[a],tmax,tmin,kmax,kmin,ans,i;
    while(scanf("%d",&n)!=EOF&&n!=0){
	    for(i=0;i<n;i++)
	    scanf("%d",&t[i]);
	    for(i=0;i<n;i++)
	    scanf("%d",&k[i]);
		sort(t,t+n,cmp);
		sort(k,k+n,cmp);
		tmax=0;
		tmin=n-1;
		kmax=0;
		kmin=n-1;
		ans=0;
		while(tmax<=tmin&&kmax<=kmin){
			if(t[tmax]>k[kmax]){
				ans++;
				tmax++;
				kmax++;
			}
			else if(t[tmin]>k[kmin]){
				ans++;
				tmin--;
				kmin--;
			}
			else
			{
				if (t[tmin]<k[kmax])
					ans--;
				tmin--;
				kmax++;
			}
		}printf("%d\n",200*ans);
	}
	return 0;
}