1080 Graduate Admission (30)

It is said that in 2013, there were 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.

Input Specification:

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.

Output Specification:

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.

Sample Input:

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

Sample Output:

0 10
3
5 6 7
2 8

1 4

题目大意：将每个学生按照成绩排序，然后根据学生的意向学校去投递， 如果意向学校已经满了，继续投递； 输出每个学校录取的学生编号
思路：建立两个struct， sch:记录学校要录取的人数， 最后一个录取学生的名次， 以及录取学生的数组； node：记录学生的成绩，编号，意向学校；
　　　　通过学生成绩依次按照每个学生的意向学校去探测意向学校是否能投递， 能投递则把学生添加到相应的学校中， 对每个学校录取的学生排序后输出；
注意点：1.对于需要排序的结构数据，一般应该在结构中记录数据的编号； 2.正确放置break点

 #include<iostream>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
struct Stu{
  int ge, gi, gf, rank;
  int id;
  int choice[5];
};
struct Sch{
  int maxn, lastrank;
  set<int> admit;
};
bool cmp(Stu& a, Stu& b){
  if(a.gf!=b.gf) return a.gf>b.gf;
  return a.ge>b.ge;
}
int main(){
  int n, m, k, i, j;
  scanf("%d%d%d", &n, &m, &k);
  vector<Sch> sch(m);
  vector<Stu> stu(n);
  for(i=0; i<m; i++) scanf("%d", &sch[i].maxn);
  for(i=0; i<n; i++){
    scanf("%d%d", &stu[i].ge, &stu[i].gi);
    stu[i].gf = (stu[i].gi+stu[i].ge)/2;
      stu[i].id=i;//排序过后  位置会改变 要设置一个变量来保存序号
    for(j=0; j<k; j++) scanf("%d", &stu[i].choice[j]);
  }
  sort(stu.begin(), stu.end(), cmp);
  int rank = 1;
  for(i=0; i<n; i++){//确定名次
    if(i==0 || (stu[i].gf==stu[i-1].gf && stu[i].gi==stu[i-1].gi)) stu[i].rank = rank;
    else{
      rank = i+1;
      stu[i].rank = rank;
    }
  }
  for(i=0; i<n; i++){
    bool flag=false;
    for(j=0; j<k; j++){
      int schid = stu[i].choice[j];
      if(sch[schid].maxn>0){
        sch[schid].admit.insert(stu[i].id);
        sch[schid].maxn--;
        sch[schid].lastrank = stu[i].rank;
            flag = true;
        }else if(sch[schid].lastrank==stu[i].rank) {
            sch[schid].admit.insert(stu[i].id);
            flag = true;
        }//记得投递成功后， 退出循环 否则会多次循环
      if(flag) break;
    }
  }
  for(i=0; i<m; i++){
    set<int>::iterator it = sch[i].admit.begin();
    for(; it!=sch[i].admit.end(); it++){
      if(it == sch[i].admit.begin()) printf("%d", *it);
      else printf(" %d", *it);
    }
    printf("
");
  }
  return 0;
}