【PAT甲级-1075】题解

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct student {
    int id, grade[6], total, rank;
    int num;
    bool flag;
}stu[1000001];
bool cmp(student a, student b) {
    if(a.total != b.total) return a.total > b.total;
    else if(a.num != b.num) return a.num > b.num;
    else return a.id < b.id;
};
int main() {
    int n, k, m, p[6], temp1, temp2, temp3;
    cin >> n >> k >> m;
    for(int i = 1; i <= n; i++) {
    	stu[i].id = i;
    	stu[i].total = 0;
    	stu[i].num = 0;
    	stu[i].rank = 0;
    	stu[i].flag = false;
    	memset(stu[i].grade, -1, sizeof(stu[i].grade));
	}
    for(int i = 0; i < k; i++) {
        cin >> p[i];
    }
    for(int i = 0; i < m; i++) {
        cin >> temp1 >> temp2 >> temp3;
        if(temp3 != -1) stu[temp1].flag = true;
        if(temp3 == p[temp2 - 1] && stu[temp1].grade[temp2 - 1] < p[temp2 - 1]) {
            stu[temp1].grade[temp2 - 1] = temp3;
            stu[temp1].num++;
        }
        if(temp3 > stu[temp1].grade[temp2 - 1]) stu[temp1].grade[temp2 - 1] = temp3;
        if(temp3 == -1 && stu[temp1].grade[temp2 - 1] == -1) stu[temp1].grade[temp2 - 1] = 0;
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j < k; j++) {
            if(stu[i].grade[j] != -1) stu[i].total += stu[i].grade[j];
        }
   }
    sort(stu + 1, stu + n + 1, cmp);
    stu[1].rank = 1;
    for(int i = 1; i < n; i++) {
        if(stu[i + 1].total == stu[i].total) stu[i + 1].rank = stu[i].rank;
        else stu[i + 1].rank = i + 1;
    }
    for(int i = 1; i <= n; i++) {
		if(stu[i].flag) {
			printf("%d %05d %d", stu[i].rank, stu[i].id, stu[i].total);
        	for(int j = 0; j < k; j++) {
            	if(stu[i].grade[j] == -1) cout << " -";
            	else cout << ' ' << stu[i].grade[j];
        	}
        cout << endl;
		}

    }
    return 0;
}