NYOJ364田忌赛马

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int tian[1005];
int king[1005];

int main()

{
int n;
while(~scanf("%d",&n))
{
for(int i = 0;i < n;++i)
scanf("%d",&tian[i]);
for(int i = 0;i < n;++i)
scanf("%d",&king[i]);
sort(tian,tian + n);
sort(king,king + n);
int win = 0;
int lose = 0;
int tl = 0,tr = n - 1;
int kl = 0,kr = n - 1;
while(tl <= tr && kl <= kr)
{
if(tian> king[kr])
{
win++;
tr--;
kr--;
}
else if(tian[tl] > king[kl])
{
win++;
tl++;
kl++;
}
else
{
if(tian[tl] == king[kr])
{
tl++;
kr--;
}
else if(tian[tl] < king[kr])
{
lose++;
tl++;
kr--;
}
}
}
printf("%d\n",(win - lose) * 200);
}
return 0;
}