pku2062.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <stdlib.h>

typedef struct
{
	int value;
	int suit;	
} Card;

Card c[2][26];

int cmp(const void *a, const void *b)
{
	Card *c = (Card *)a;
	Card *d = (Card *)b;
	if (c->value != d->value) return c->value - d->value;
	else return c->suit - d->suit;
}

int main()
{
	int t;
	int n, i, j, p;
	char s[3];
	
	scanf("%d", &t);
	
	while (t--)
	{
		scanf("%d", &n);
		
		for (j = 0; j < 2; j++)
		{
			for (i = 0; i < n; i++)
			{
				scanf("%s", s);
				if (s[0] == 'T')
				{
					c[j][i].value = 10;	
				}
				else if(s[0] == 'J')
				{
					c[j][i].value = 11;
				}	
				else if(s[0] == 'Q')
				{
					c[j][i].value = 12;
				}	
				else if(s[0] == 'K')
				{
					c[j][i].value = 13;
				}	
				else if(s[0] == 'A')
				{
					c[j][i].value = 14;
				}
				else
				{
					c[j][i].value = s[0] - '0';	
				}
			
				switch(s[1])
				{
					case 'H' : 
						{
							c[j][i].suit = 4;
							break;
						}	
					case 'S' : 
						{
							c[j][i].suit = 3;
							break;
						}	
					case 'D' : 
						{
							c[j][i].suit = 2;
							break;
						}	
					case 'C' : 
						{
							c[j][i].suit = 1;
							break;
						}	
				}
			}
			qsort(c[j], n, sizeof(c[0][0]), cmp);	
		}
		
		for (i = 0, p = 0, j = 0; i < n && j < n; i++)
		{
			if (cmp(&c[0][j], &c[1][i]) < 0)
			{
				p++;
				j++;	
			}	
		}
		printf("%d\n", p);
			
	}
	return 0;
}