WOJ1134-Card Game

Adam and Eve play a card game using a regular deck of 52 cards. The rules are simple. The
players sit on opposite sides of a table, facing each other. Each player gets k cards from the
deck and, after looking at them, places the cards face down in a row on the table. Adam?s
cards are numbered from 1 to k from his left, and Eve?s cards are numbered 1 to k from her
right (so Eve?s i:th card is opposite Adam's i:th card). The cards are turned face up, and
points are awarded as follows (for each i ∈ {1, . . . , k}):
If Adam's i:th card beats Eve?s i:th card, then Adam gets one point.
If Eve's i:th card beats Adam?s i:th card, then Eve gets one point.
A card with higher value always beats a card with a lower value: a three beats a two,
a four beats a three and a two, etc. An ace beats every card except (possibly) another
ace.
If the two i:th cards have the same value, then the suit determines who wins: hearts
beats all other suits, spades beats all suits except hearts, diamond beats only clubs, and
clubs does not beat any suit.
For example, the ten of spades beats the ten of diamonds but not the Jack of clubs.
This ought to be a game of chance, but lately Eve is winning most of the time, and the
reason is that she has started to use marked cards. In other words, she knows which cards
Adam has on the table before he turns them face up. Using this information she orders her
own cards so that she gets as many points as possible.
Your task is to, given Adam's and Eve's cards, determine how many points Eve will get
if she plays optimally.

输入格式

There will be several test cases. The first line of input will contain a single positive integer N
giving the number of test cases. After that line follow the test cases.
Each test case starts with a line with a single positive integer k ≤ 26 which is the number
of cards each player gets. The next line describes the k cards Adam has placed on the table,
left to right. The next line describes the k cards Eve has (but she has not yet placed them on
the table). A card is described by two characters, the first one being its value (2, 3, 4, 5, 6, 7,
8 ,9, T, J, Q, K, or A), and the second one being its suit (C, D, S, or H). Cards are separated
by white spaces. So if Adam?s cards are the ten of clubs, the two of hearts, and the Jack of
diamonds, that could be described by the line
TC 2H JD

输出格式

For each test case output a single line with the number of points Eve gets if she picks the
optimal way to arrange her cards on the table.

样例输入

3
1
JD
JH
2
5D TC
4C 5H
3
2H 3H 4H
2D 3D 4D

样例输出

1
1
2

把第一个人的排存到一个集合中，对于第二个人的每一张牌，在集合里找一个能覆盖的最大的删去，如果有，答案加一。

#include
#include
#include
#include
using namespace std;
char s[4];
int n,k,vis[28];
struct card{
	int x,y;
};
card adam[28],eve[28];
card change(char* s){
	card temp;
	switch(s[0]){
		case 'T':temp.x=10;break;
		case 'J':temp.x=11;break;
		case 'Q':temp.x=12;break;
		case 'K':temp.x=13;break;
		case 'A':temp.x=14;break;
		default:temp.x=s[0]-'0';
	}
	switch(s[1]){
		case 'H':temp.y=4;break;
		case 'S':temp.y=3;break;
		case 'D':temp.y=2;break;
		case 'C':temp.y=1;
	}
	return temp;
}
bool cmp(card c1,card c2){
	if(c1.x==c2.x)
	return c1.y