注意边界条件,代码如下:
#include<cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int fmark[6];
//注意边界条件,例如6号提交了,但得分为0,仍需要输出
//所以在结构体中,设置flag来表示是否有“通过编译的提交”
//如果有,则flag记为true
struct User {
int id, score[6], total;
int perfect,rank;
bool flag;
};
User user[10005];
bool cmp(User a, User b) {
//没有有效提交的,统统放后面
if (a.flag != b.flag) return a.flag > b.flag;
else if (a.total != b.total)return a.total > b.total;
else if (a.perfect != b.perfect)return a.perfect > b.perfect;
else return a.id < b.id;
}
int main() {
int n, k, m;
scanf("%d %d %d", &n, &k, &m);
for (int i = 1; i <= k; i++) {
scanf("%d", &fmark[i]);
}
int id, no, sc;
for (int i = 1; i <= n; i++) {
user[i].id = i;
memset(user[i].score, -1, sizeof(user[i].score));
user[i].flag = false;
}
for (int i = 0; i < m; i++) {
scanf("%d %d %d", &id, &no, &sc);
user[id].id = id;
if (user[id].score[no] < sc) {
user[id].score[no] = sc;
if (sc == fmark[no])
user[id].perfect++;
user[id].flag = true;
}
else if (sc == -1 && user[id].score[no] == -1)user[id].score[no] = 0;
}
for (int i = 1; i <= n; i++) {
int total = 0;
for (int j = 1; j <= k; j++) {
if (user[i].score[j] == -1)continue;
total += user[i].score[j];
}
user[i].total = total;
}
sort(user + 1, user + n + 1, cmp);
for (int i = 1; i <= n; i++) {
if (i == 1) user[1].rank = 1;
else if (!user[i].flag)break;
else if (user[i].total == user[i - 1].total)user[i].rank = user[i - 1].rank;
else user[i].rank = i;
printf("%d %05d %d", user[i].rank, user[i].id, user[i].total);
for (int j = 1; j <= k; j++) {
if (user[i].score[j]>=0)printf(" %d", user[i].score[j]);
else printf(" -");
}
printf("\n");
}
return 0;
}