这题WA了很久很久，确定算法没错.. 但是还是WA了很久很久...
原因是Ace的初值没有赋值=.=
细节决定成败！！
#include<iostream>
#include<map>
using namespace std;struct Edge{int v,next;
}E[6666];bool vis[66];
int ptr[66],match[66],Edgenum;void addEdge( int u,int v )
{E[Edgenum].v=v;E[Edgenum].next=ptr[u];ptr[u]=Edgenum++;
}int getnum( char *str )
{int ret=0;if( str[0]=='T' ) ret=40;else if( str[0]=='J' ) ret=44;else if( str[0]=='Q' ) ret=48;else if( str[0]=='K' ) ret=52;else if( str[0]=='A' ) ret=56;else ret=(str[0]-'0')*4;if( str[1]=='C' ) ret+=1;else if( str[1]=='D' ) ret+=2;else if( str[1]=='S' ) ret+=3;else if( str[1]=='H' ) ret+=4;return ret;
}bool Match( int cur )
{for( int i=ptr[cur];i!=-1;i=E[i].next ){if( !vis[E[i].v] ){vis[E[i].v]=true;if( match[E[i].v]==-1 || Match(match[E[i].v]) ){match[E[i].v]=cur;return true;}}}return false;
}int main()
{int T;scanf( "%d",&T );while( T-- ){memset( ptr,-1,sizeof(ptr) );memset( match,-1,sizeof(match) );Edgenum=0;int N;char str[11];int val[66];scanf( "%d",&N );for( int i=0;i<N*2;i++ ){scanf( "%s",&str );val[i]=getnum(str);}for( int i=N;i<N*2;i++ )for( int j=0;j<N;j++ )if( val[i]>val[j] )addEdge( i-N,j );int ans=0;for( int i=0;i<N;i++ ){memset( vis,0,sizeof(vis) );if( Match(i) )ans++;}printf( "%d\n",ans );}return 0;
}