http://acm.hdu.
#include <stdio.h>
#include <algorithm>
using namespace std;
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int i,n,j,d,a,k;
    int z[10000],x[10000];
    while(scanf("%d",&n)!=EOF)
    {
        d=0;
        if(n==0)
            break;
        for(i=0;i<n;i++)
            scanf("%d",&z[i]);
        for(i=0;i<n;i++)
            scanf("%d",&x[i]);
        sort(z,z+n,cmp);
        sort(x,x+n,cmp);
        i=0;j=0;a=n;k=n-1;
        while(a--)
        {
            if(z[i]<x[j])
            {
                if(z[k]<x[j])
                {
                d-=200;k--;
                }
                else if(z[k]>x[j])
                {
                d+=200;k--;
                }
                j++;
            }
            else if(z[i]==x[j])
            {
                if(z[k]<x[j])
                {
                d-=200;k--;
                }
                else if(z[k]>x[j])
                {
                d+=200;k--;
                }
                j++;i++;
            }
            else if(z[i]>x[j])
            {
                j++;i++;
                d+=200;
            }
        }
        printf("%d\n",d);
    }
    return 0;
}

谢谢，我懂了