PAT-A1080-Graduate Admisson

1080-Graduate Admission - 题目链接

---

题目描述

 It is said that in 2011, there are about 100 graduate schools ready to proceed over 40,000 applications in Zhejiang Province. It would help a lot if you could write a program to automate the admission procedure.
Each applicant will have to provide two grades: the national entrance exam grade G
E , and the interview grade G I . The final grade of an applicant is (G E +G I )/2. The admission rules are:
The applicants are ranked according to their final grades, and will be admitted one by one from the top of the rank list.
If there is a tied final grade, the applicants will be ranked according to their national entrance exam grade G
E
​
. If still tied, their ranks must be the same.
Each applicant may have K choices and the admission will be done according to his/her choices: if according to the rank list, it is one’s turn to be admitted; and if the quota of one’s most preferred shcool is not exceeded, then one will be admitted to this school, or one’s other choices will be considered one by one in order. If one gets rejected by all of preferred schools, then this unfortunate applicant will be rejected.
If there is a tied rank, and if the corresponding applicants are applying to the same school, then that school must admit all the applicants with the same rank, even if its quota will be exceeded.

输入描述

 Each input file contains one test case.
Each case starts with a line containing three positive integers: N (≤40,000), the total number of applicants; M (≤100), the total number of graduate schools; and K (≤5), the number of choices an applicant may have.
In the next line, separated by a space, there are M positive integers. The i-th integer is the quota of the i-th graduate school respectively.
Then N lines follow, each contains 2+K integers separated by a space. The first 2 integers are the applicant’s G
E and G I, respectively. The next K integers represent the preferred schools. For the sake of simplicity, we assume that the schools are numbered from 0 to M−1, and the applicants are numbered from 0 to N−1.

输出描述

 For each test case you should output the admission results for all the graduate schools. The results of each school must occupy a line, which contains the applicants’ numbers that school admits. The numbers must be in increasing order and be separated by a space. There must be no extra space at the end of each line. If no applicant is admitted by a school, you must output an empty line correspondingly.

---

示例：

输入

11 6 3
2 1 2 2 2 3
100 100 0 1 2
60 60 2 3 5
100 90 0 3 4
90 100 1 2 0
90 90 5 1 3
80 90 1 0 2
80 80 0 1 2
80 80 0 1 2
80 70 1 3 2
70 80 1 2 3
100 100 0 2 4

输出

0 10
3
5 6 7
2 8
这里手动换行 markdown还不是很熟嘿嘿
1 4

---

解题思路

 1.首先是两个结构数组用于存放我们读取的数据，学生数组里面存放学生的id号，初试成绩，复试成绩和总和（这里聪明点别用平均），然后学生的排名，还有学校的志愿。
 2.在学校的结构数组里面，我们建立一个int类型的数组用于存放已经录取考生的数据排名编号；声明一个变量记录当前最后一个录取考生的排名；学校录取的总人数；学校录取当前的人数变量。
 3.首先按部就班，刚开始读入数据的步骤比较简单；
 4.按照排序要求编写学生成绩之间的排序函数，对学生数据进行排序；
 5.其次是开始遍历每一个学生，还有他们的志愿情况，如果该学校的人数未满或者最后一名的排名和当前学生的排名是一样的，并且当前的学校不能是没有录取人时就可以进行录取，修改一系列的值。
 在输出遍历学校的时候，我们开始对录取学生id进行排序再输出，这里注意，我们存取的是排序后的编号，并不是实际的编号，这里我们需要重新对应一遍，没有录取的学校打印个空行就好。

参考代码

#include <cstdio>
#include <algorithm>

using namespace std;

struct School {
    int Schmax;
    int Sch_stu[40010];
    int lastAdmit = -1; //初始值为-1 说明没有录取人
    int now_admit = 0; //当前录取的人数
} School[110];

struct Stu {
    int id;//学生的编号
    int GE, GI, sum;
    int rank;
    int choice[10];//学生的志愿
} Stu[40010];

bool cmpRank(struct Stu a, struct Stu b) {
    if (a.sum != b.sum) {
        return a.sum > b.sum;
    } else {
        return a.GE > b.GE;
    }
}

bool cmpStuid(int a, int b) {
    return Stu[a].id < Stu[b].id;
}


int main() {
    int n, m, k;
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 0; i < m; ++i) {
        scanf("%d", &School[i].Schmax);
    }
    for (int i = 0; i < n; ++i) {
        Stu[i].id = i;
        scanf("%d %d", &Stu[i].GE, &Stu[i].GI);
        Stu[i].sum = Stu[i].GE + Stu[i].GI;
        for (int j = 0; j < k; ++j) {
            scanf("%d", &Stu[i].choice[j]);
        }
    }
    sort(Stu, Stu + n, cmpRank);//以上为读取数据 对数据进行保存
    for (int i = 0; i < n; ++i) { //记录排名哦
        if (i > 0 && Stu[i].sum == Stu[i - 1].sum && Stu[i].GE == Stu[i-1].GE) {
            Stu[i].rank = Stu[i - 1].rank;
        } else {
            Stu[i].rank = i;
        }
    } 

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < k; ++j) {
            int singleSch = Stu[i].choice[j];
            int lastAdmit = School[singleSch].lastAdmit;
            int now_num = School[singleSch].now_admit;
            if ((now_num < School[singleSch].Schmax) || (Stu[i].rank == Stu[lastAdmit].rank && lastAdmit != -1)) { //录取的条件
                School[singleSch].lastAdmit = i;
                School[singleSch].Sch_stu[now_num] = i;
                School[singleSch].now_admit++;
                break;
            }
        }
    }

    for (int i = 0; i < m; ++i) {
        if (School[i].now_admit > 0) {
            sort(School[i].Sch_stu, School[i].Sch_stu + School[i].now_admit, cmpStuid); //注意这里cmp函数排序的是什么
            for (int j = 0; j < School[i].now_admit; ++j) {
                if (j != 0) {
                    printf(" ");
                }
                printf("%d", Stu
                [School[i].Sch_stu[j]].id); //最后输出的是id，不是排名结果
            }
        }
        printf("\n");
    }

    return 0;
}