1075 PAT Judge (25分)

1075 PAT Judge (25分)

题目很难读，坑点多，最后两个测试点过不去，在牛客网倒是能过，实在找不到，就先这样吧

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
struct node {
	int id, sum = -1, flag = 0, pro[10] = { 0 };
};
bool cmp(node a, node b) {
	return a.sum != b.sum ? a.sum > b.sum:(a.flag != b.flag ? a.flag > b.flag:a.id < b.id);
}
int main() {
	int n, k, m, id, p, t, full[10] = { 0 };
	node stu[10010];
	scanf("%d%d%d", &n, &k, &m);
	for (int i = 1; i <= k; i++) {
		scanf("%d", &full[i]);
	}
	for (int i = 0; i < m; i++) {
		scanf("%d%d%d", &id, &p, &t);
		stu[id].id = id;
		int temp = stu[id].pro[p];
		if ((t == -1 || t == 0) && temp <= 0) {
			stu[id].pro[p] = -1;
			if (t == 0) { stu[id].sum = max(0, stu[id].sum); }
		}
		else if (t > temp) {
			stu[id].sum = t + max(stu[id].sum, 0) - max(0, temp);
			stu[id].pro[p] = t;
			if (t == full[p]) { stu[id].flag++; }
		}
	}
	sort(stu, stu + 10000, cmp);
	int cnt = 1;
	for (int i = 0; i < n; i++) {
		if (stu[i].sum == -1) { break; }
		if (i && stu[i].sum != stu[i - 1].sum) { cnt = i + 1; }
		printf("%d %05d %d", cnt, stu[i].id, stu[i].sum);
		for (int j = 1; j <= k; j++) {
			if (stu[i].pro[j] == -1) {
				printf(" 0");
			}
			else if (stu[i].pro[j] == 0) {
				printf(" -");
			}
			else {
				printf(" %d", stu[i].pro[j]);
			}
		}
		printf("\n");
	}
	return 0;
}