田忌赛马

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[1010],b[1010];
int main()
{
    int n;
    while(scanf("%d",&n),n)//输入田忌和齐王妈的匹数
    {
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        for(int i=1; i<=n; i++)
            scanf("%d",&b[i]);
        sort(a+1,a+n+1);//按照马速递增顺序排列
        sort(b+1,b+1+n);//按照马速递增顺序排列
        int tl=1,tr=n,ql=1,qr=n;
        int sum=0;

        while(tl<=tr)
        {
            if(a[tl]<b[ql])//若田忌最慢的马慢于齐王最慢的马
                //田忌最慢的马与齐王最快的马比赛   输一场
            {
                qr--;
                tl++;
                sum=sum-200;
            }
            else if(a[tl]==b[ql])//若田忌最慢的马与齐王最慢的马相同
            {
                while(tl<=tr&&ql<=qr)//循环  直到田忌或齐王的马序列为空
                {
                    if(a[tr]>b[qr])//若田忌的最快的马快于齐王最快的马
                        //则田忌最快的马与齐王最快的马比赛   赢一场
                    {
                        sum+=200;
                        tr--;
                        qr--;
                    }
                    else//否则  若田忌最慢的马慢于齐王最快的马
                        //则田忌最慢的马比齐王最快的马    输一场     退出while
                    {
                        if(a[tl]<b[qr])
                            sum-=200;
                        tl++;
                        qr--;
                        break;
                    }
                }
            }
            else//若田忌最慢的马快于齐王最慢的马   则最慢与最慢比    赢一场
            {
                tl++;
                ql++;
                sum=sum+200;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}