The Preliminary Contest for ICPC Asia Shenyang 2019 Texas hold'em Poker

 https://nanti.jisuanke.com/t/41408

每种牌赋予权值，注意多个13（剩余手牌相交）时超出最优先的组合（有对）的权值；

#include<bits/stdc++.h>
#define endl '\n'
#define mem(a) memset(a,0,sizeof(a))
#define debug cout<<1<<endl
const long long inf = 1e9;
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
struct node {
	string name;
	string P;
	ll val;
	bool operator < (const node &s)const {
		if (val != s.val)
			return val>s.val;
		else return name<s.name;
	}
}a[N];
map<char, ll>mp;
int have[20];
void init() {
	mp['A'] = 1;
	mp['2'] = 2;
	mp['3'] = 3;
	mp['4'] = 4;
	mp['5'] = 5;
	mp['6'] = 6;
	mp['7'] = 7;
	mp['8'] = 8;
	mp['9'] = 9;
	mp['J'] = 11;
	mp['Q'] = 12;
	mp['K'] = 13;
}
int main() {
	int n;
	init();
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	while (cin >> n) {
		for (int i = 1;i <= n;i++) {
			cin >> a[i].name >> a[i].P;
		}
		for (int i = 1;i <= n;i++) {
			int len = a[i].P.size();
			mem(have);
			int ans = 0;
			for (int j = 0;j<len;j++) {
				if (j != len - 1 && a[i].P[j] == '1'&&a[i].P[j + 1] == '0') {//10
					ans += 10;
					have[10]++;
					j++;
				}
				else {
					have[mp[a[i].P[j]]]++;
					ans += mp[a[i].P[j]];
				}
			}
			if (have[10] && have[11] && have[12] && have[13] && have[1]) {
				a[i].val = 8 * inf;
				continue;
			}
			else {
				int flag = 0;
				for (int j = 1;j <= 9;j++) {//顺子
					if (have[j] && have[j + 1] && have[j + 2] && have[j + 3] && have[j + 4]) {
						a[i].val = 7 * inf + (j+4)*1000;
						flag = 1;
						break;
					}
				}
				if (flag)
					continue;
				for (int j = 1;j <= 13;j++) {
					if (have[j] >= 4) {
						a[i].val = 6 * inf + j*10000+(ans-j*4);
						flag = 1;
						break;
					}
					if(flag)
                        break;
				}
				if (flag)
					continue;
				for (int j = 1;j <= 13;j++) {
					for (int k = 1;k <= 13;k++) {
						if (have[j] == 3 && have[k] == 2) {
							a[i].val = 5 * inf + j*10000 + 10 *k;
							flag = 1;
							break;
						}
					}
					if(flag)
                        break;
				}
				if (flag)
					continue;
				for (int j = 1;j <= 13;j++) {
					if (have[j] == 3) {
						a[i].val = 4 * inf + j*1000+(ans-j*3);
						flag = 1;
						break;
					}
				}
				if (flag)
					continue;
				for (int j = 1;j <= 13;j++) {
					for (int k = j + 1;k <= 13;k++) {
						for (int s = 1;s <= 13;s++) {
                            if(have[j]==2&&have[k]==2&&have[s]==1){
                                a[i].val = 3 * inf + k * 100000+j*100 + s;
                                flag = 1;
                            }
						}
					}
				}
				if (flag)
					continue;
				for (int j = 1;j <= 13;j++) {
					if (have[j] == 2) {
						a[i].val = 2 * inf + j * 10000 + (ans - j * 2);
						flag = 1;
					}
				}
				if (flag)
					continue;
				a[i].val = ans;
			}
		}
		sort(a + 1, a + 1 + n);
		for (int i = 1;i <= n;i++) {
			cout << a[i].name << endl;
		}
	}
}