HDU 1052（贪心）

#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
using namespace std;

int TianJi[1005];
int WeiWang[1005];

int vs_main()
{
    int n;
    int i,j;
    while (cin >> n,n)
    {
        for (i = 1; i <= n; i++)
        {
            cin >> TianJi[i];
        }
        for (i = 1; i <= n; i++)
        {
            cin >> WeiWang[i];
        }
        sort(TianJi + 1, TianJi + n + 1);
        sort(WeiWang + 1, WeiWang + n + 1);
        int Tslow = 1;
        int Tfast = n;
        int Kslow = 1;
        int Kfast = n;
        int win = 0;
        int lose = 0;
        while (Tslow <= Tfast)
        {
            if (WeiWang[Kslow] < TianJi[Tslow])
            {
                win++;
                Tslow++;
                Kslow++;
            }
            else if (WeiWang[Kslow] > TianJi[Tslow])
            {
                lose++;
                Tslow++;
                Kfast--;
            }
            else
            {
                if (WeiWang[Kfast] < TianJi[Tfast])
                {
                    win++;
                    Kfast--;
                    Tfast--;
                }
                else
                {
                    if (TianJi[Tslow] < WeiWang[Kfast])
                    {
                        lose++;
                    }
                    Kfast--;
                    Tslow++;
                }
            }
        }
        cout << (win - lose) * 200 << endl;
    }
    return 0;
}