PAT 1080

排序题目，搞混了一件事情，那就是，排序结束之后顺序是变的啊亲... 很丑地解决了问题，其实应该对每一个学校维护一个last applicant比较，不过能过就行了

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct Applicant{
    int ge;
    int gi;
    int score;

    int idx;

    vector<int> apply_school;
};

struct sort_op{
    bool operator()(Applicant a1, Applicant a2){
        if (a1.score != a2.score)
            return (a1.score > a2.score);
        return (a1.ge > a2.ge);
    }
};

int main(){
    int N, M, K;
    cin >> N >> M >> K;

    vector<Applicant> applicants(N);
    vector<vector<int> > school_res(M);
    vector<int> school_quato(M);

    for (int i = 0; i < M; i++){
        int cnt;
        cin >> cnt;
        school_quato[i] = cnt;
    }

    for (int i = 0; i < N; i++){
        int ge, gi, idx;
        cin >> ge >> gi;

        applicants[i].ge = ge;
        applicants[i].gi = gi;
        applicants[i].score = ge + gi;
        applicants[i].idx = i;

        for (int j = 0; j < K; j++){
            cin >> idx;
            applicants[i].apply_school.push_back(idx);
        }
    }

    vector<Applicant> bck_up = applicants;
    sort(applicants.begin(), applicants.end(), sort_op());

    for (int i = 0; i < N; i++){
        for (int j = 0; j < K; j++){
            int school_idx = applicants[i].apply_school[j];
            if (school_quato[school_idx] > 0){
                school_quato[school_idx]--;
                school_res[school_idx].push_back(applicants[i].idx);

                break;
            } else {
                if (school_res[school_idx].size() == 0) continue;
                int last = school_res[school_idx].back();
                if (applicants[i].gi == bck_up[last].gi && applicants[i].ge == bck_up[last].ge){
                    school_res[school_idx].push_back(applicants[i].idx);
                    school_quato[school_idx]--;
                    break;
                }
            }
        }
    }

    for (int i = 0; i < school_res.size(); i++){
        if (school_res[i].size() != 0){
            sort(school_res[i].begin(), school_res[i].end());
            cout << school_res[i][0];

            for (int j = 1; j < school_res[i].size(); j++)
                cout << " " << school_res[i][j];
        }

        cout << endl;
    }

    return 0;
}