【PAT甲级-1080】题解

#include<iostream>
#include<algorithm>
using namespace std;
struct student {
    int ge, gi, grade;
    int choices[6], rank, id;
}app[100001];

struct school {
    int quota, stunum, id[40010], lastAdmit; 
}sch[110];

bool cmp1(student a, student b) {
    if(a.grade != b.grade) return a.grade > b.grade;
    else return a.ge > b.ge;
}
bool cmp2(int a, int b) {
	return app[a].id < app[b].id;
}
int main() {
    int n, m, k;
    cin >> n >> m >> k;
    for(int i = 0; i < m; i++) {
        cin >> sch[i].quota;
        sch[i].stunum = 0;
        sch[i].lastAdmit = -1;
    }
    for(int i = 0; i < n; i++) {
    	app[i].id = i;
    	cin >> app[i].ge >> app[i].gi;
    	app[i].grade = (app[i].ge + app[i].gi) / 2;
    	for(int j = 0; j < k; j++) {
    		cin >> app[i].choices[j];
		}
	}
	sort(app, app + n, cmp1);
	for(int i = 0; i < n; i++) {
		if(i > 0 && app[i - 1].grade == app[i].grade && app[i - 1].ge == app[i].ge) app[i].rank = app[i - 1].rank;
		else app[i].rank = i;
	}
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < k; j++) {
			int choice = app[i].choices[j];
			int num = sch[choice].stunum;
			int last = sch[choice].lastAdmit;
			if(num < sch[choice].quota || (last != -1 && app[i].rank == app[last].rank)) {
				sch[choice].id[num] = i;
				sch[choice].lastAdmit = i;
				sch[choice].stunum++;
				break;
			}
		}
	}
	for(int i = 0; i < m; i++) {
		if(sch[i].stunum > 0) {
			sort(sch[i].id, sch[i].id + sch[i].stunum, cmp2);
			for(int j = 0; j < sch[i].stunum; j++) {
				cout << app[sch[i].id[j]].id;
				if(j < sch[i].stunum - 1) cout << ' ';
			}
		}
		cout << endl;
	}
	return 0;
}