题目1005:Graduate Admission
来源:互联网 发布:代工上淘宝好吗 编辑:程序博客网 时间:2024/06/04 19:19
- 题目描述:
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 GE, and the interview grade GI. The final grade of an applicant is (GE + GI) / 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 GE. 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 may contain more than 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 GE and GI, 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 32 1 2 2 2 3100 100 0 1 260 60 2 3 5100 90 0 3 490 100 1 2 090 90 5 1 380 90 1 0 280 80 0 1 280 80 0 1 280 70 1 3 270 80 1 2 3100 100 0 2 4
- 样例输出:
0 1035 6 72 81 4
- #include <iostream>
- #include <algorithm>
- using namespace std;
- /*定义学生类,class和struct其实一个样,可以直接变为结构体*/
- class Student
- {
- public:
- int id;
- int ge;
- int gi;
- int choice[5];
- };
- /*定义学校类*/
- class School
- {
- public:
- int quota;
- Student std[100];
- int front,rear;
- };
- /*学生成绩排序函数*/
- bool cmp(Student a,Student b)
- {
- if(a.ge+a.gi!=b.ge+b.gi )
- return a.ge+a.gi>b.ge+b.gi;
- else
- return a.ge>b.ge;
- }
- /*学生id排序函数*/
- bool cmpa(Student a,Student b)
- {
- return a.id<b.id;
- }
- int main()
- {
- int n,m,k;
- int i,j;
- while(cin>>n>>m>>k)
- {
- Student std[100];
- School sch[100];
- /*学校信息录入*/
- for(i=0;i!=m;i++)
- {
- cin>>sch[i].quota;
- sch[i].front=0;
- sch[i].rear=0;
- }
- /*学生信息录入*/
- for(i=0;i!=n;i++)
- {
- cin>>std[i].ge>>std[i].gi;
- for(j=0;j!=k;j++)
- cin>>std[i].choice[j];
- std[i].id=i;
- }
- /*学生成绩排序*/
- sort(std,std+n,cmp);
- /*按学生成绩从高到低分配学校*/
- for(i=0;i!=n;i++)
- {
- /*按志愿先后选择学校*/
- for(j=0;j!=k;j++)
- {
- /*学校还有名额时,直接入该学校的队列*/
- if(sch[std[i].choice[j]].quota>0)
- {
- sch[std[i].choice[j]].std[sch[std[i].choice[j]].rear++]=std[i];
- sch[std[i].choice[j]].quota--;
- break;
- }
- /*学校没有名额时,成绩是否与最后一名录取的学生相同,同则进*/
- else if(std[i].ge==sch[std[i].choice[j]].std[sch[std[i].choice[j]].rear-1].ge
- &&std[i].gi==sch[std[i].choice[j]].std[sch[std[i].choice[j]].rear-1].gi)
- {
- sch[std[i].choice[j]].std[sch[std[i].choice[j]].rear++]=std[i];
- sch[std[i].choice[j]].quota--;
- break;
- }
- }
- }
- /*输出每个学校录取者的id*/
- for(i=0;i!=m;i++)
- {
- if(sch[i].front==sch[i].rear)
- cout<<endl;
- else
- {
- /*学生id排序*/
- sort(sch[i].std,sch[i].std+sch[i].rear,cmpa);
- cout<<sch[i].std[sch[i].front++].id;
- while(sch[i].front!=sch[i].rear)
- cout<<' '<<sch[i].std[sch[i].front++].id;
- cout<<endl;
- }
- }
- }
- return 0;
- }
- 题目1005:Graduate Admission
- 题目1005:Graduate Admission
- 题目1005:Graduate Admission
- 题目1005:Graduate Admission
- 题目1005:Graduate Admission
- 题目1005:Graduate Admission
- 题目1005:Graduate Admission
- 题目1005:Graduate Admission
- 题目1005:Graduate Admission
- JD_OJ 题目1005:Graduate Admission
- 算法练习-题目1005:Graduate Admission
- 【九度】题目1005:Graduate Admission
- 九度OJ--题目1005:Graduate Admission
- 九度 题目1005:Graduate Admission
- 九度题目1005:Graduate Admission
- 九度 oj 题目1005:Graduate Admission
- [Jobdu] 1005:Graduate Admission
- 1005—Graduate Admission
- MAC编译4.4代码出错SyntaxError: Unable to find any JNI methods for org/chromium/ui/Clipboard.
- BASE64编解码
- 比较好的libevent简介
- jQuery中实现自定义方法的扩展
- Android 中文数字证书解释
- 题目1005:Graduate Admission
- 20140827 N2
- web项目配置日志功能
- python 学习之lambda 、filter、map 简单学习
- Leetcode: Permutation Sequence
- Flex读取非UTF-8中文数据乱码问题的解决方案
- Flex将GB2313中文编码转为UTF-8
- Buildroot编译需要用到的软件包
- 今日作息及食谱(8.27)