POJ 2062 HDU 1528 ZOJ 2223 Card Game Cheater

水题，感觉和田忌赛马差不多

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
 
struct P1
{
    int Num;
    int Hua;
} Play1[];
 
struct P2
{
    int Num;
    int Hua;
} Play2[];
 
bool cmp1(const P1&a,const P1&b)
{
    if(a.Num==b.Num) return a.Hua<b.Hua;
    return a.Num<b.Num;
}
bool cmp2(const P2&a,const P2&b)
{
    if(a.Num==b.Num) return a.Hua<b.Hua;
    return a.Num<b.Num;
}
 
int main()
{
    int n;
    int i,j;
    char s[];
    int TT;
    scanf("%d",&TT);
    while(TT--)
    {
        scanf("%d",&n);
        for(i=; i<n; i++)
        {
            scanf("%s",s);
            int num,hua;
            if(s[]>=''&&s[]<='') num=s[]-'';
            if(s[]=='T') num=;
            if(s[]=='J') num=;
            if(s[]=='Q') num=;
            if(s[]=='K') num=;
            if(s[]=='A') num=;
            Play1[i].Num=num;
            if(s[]=='C') hua=;
            if(s[]=='D') hua=;
            if(s[]=='S') hua=;
            if(s[]=='H') hua=;
            Play1[i].Hua=hua;
        }
        sort(Play1,Play1+n,cmp1);
        for(i=; i<n; i++)
        {
            scanf("%s",s);
            int num,hua;
            if(s[]>=''&&s[]<='') num=s[]-'';
            if(s[]=='T') num=;
            if(s[]=='J') num=;
            if(s[]=='Q') num=;
            if(s[]=='K') num=;
            if(s[]=='A') num=;
            Play2[i].Num=num;
            if(s[]=='C') hua=;
            if(s[]=='D') hua=;
            if(s[]=='S') hua=;
            if(s[]=='H') hua=;
            Play2[i].Hua=hua;
        }
        sort(Play2,Play2+n,cmp2);
        int ans=;
        int P=;
        for(i=; i<n; i++)
        {
            for(j=P; j<n; j++)
            {
                if((Play2[j].Num>Play1[i].Num)||(Play2[j].Num==Play1[i].Num&&Play2[j].Hua>Play1[i].Hua))
                {
                    ans++;
 
                    P=j+;break;
                }
            }
        }
        printf("%d\n",ans);
    }
    return ;
}