HDU 1052 Tian Ji -- The Horse Racing

#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a,const void *b)
{
return *(int *)b-*(int *)a;
}
int main()
{
int n,a[1010],b[1010],i,j,win,lose,k1,k2;
while(scanf("%d",&n)&&n)
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
scanf("%d",&b[i]);
qsort(a,n,sizeof(a[0]),cmp);
qsort(b,n,sizeof(b[0]),cmp);
k1=k2=n;
for(i=0,win=0,lose=0,j=0;i<k1;)
{
if(a[i]>b[j])
{
j++;
win++;
i++;
}
else if(a[i]<b[j])
{
j++;
k1--;
lose++;
}
else if(a[k1-1]>b[k2-1])
{
k2--;
k1--;
win++;
}
else if(a[k1-1]<b[k2-1])
{
j++;
k1--;
lose++;
}
else
{
j++;
k1--;
if(a[k1]<b[j-1])
lose++;
else if(a[k1]>b[j-1])
win++;
}
}
printf("%d\n",200*(win-lose));
}
return 0;
}