poj-2287---Tian Ji -- The Horse Racing

#include<iostream>
#include<algorithm>
using namespace std;
bool cmp(const int,const int);
] = {};
] = {};
int main()
{
    int n;
    ){
        ,te = n-,ke = n-,kf = ,i;
        ;i<n;++i)cin>>tian[i];
        ;i<n;++i)cin>>king[i];
        sort(king,king+n,cmp);
        sort(tian,tian+n,cmp);
        ;
        ;
        while(tf<=te && kf<=ke){//
            if(tian[tf] > king[kf]){//最快的能跑过，赚钱
                tf++;kf++;cut +=;
            }else if(tian[tf] < king[kf]){//跑不过，最慢的兑子，亏200
                te--;kf++;cut -=;
            }else
            {//最快的相等，用最慢的兑子
                if(tian[te] > king [ke]){//最慢的能赚钱
                    ke--;te--;cut += ;
                }else{
                    ;//赚不了钱的兑子
                    te--;kf++;
                }
            }
        }
        cout<<cut<<endl;
    }
    ;
}
bool cmp(const int a,const int b){
    return a>b;
}