时间限制：1 秒内存 限制：32 兆 特殊判题：否 提交：6721 解决：1945
题目描述：
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 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
1 4
来源：
2011年浙江大学计算机及软件工程研究生机试真题
答疑：
解题遇到问题?分享解题心得?讨论本题请访问：http://t.jobdu.com/thread-7729-1-1.html
#include<iostream>
#include<fstream>
using namespace std;
typedef struct apl
{
int g1;//GE
int g2;//GI
int g3;//总成绩
int id;//考生号
int rank;//名次
int choice[5];//考生选择
}apl;
typedef struct app
{
int ID;
int ranks;
}app;
typedef struct sch
{
int n;//最大招收人数
int n1;//实际招收人数
app apl_id[4001]; // 招收人的id
}sch;
apl a[40000];
sch b[100];
int main()
{
ifstream in;
in.open("2.txt");
int OL1,OL2,OL3;
for(int i=0;i<40000;i++)
for(int j=0;j<5;j++)
a[i].choice[j]=-1;
while(in>>OL1>>OL2>>OL3)
{
for(int i=0;i<OL2;i++)
{
in>>b[i].n;
b[i].n1=0;
}
for(int i=0;i<OL1;i++)
{
in>>a[i].g1>>a[i].g2;
for(int j=0;j<OL3;j++)
in>>a[i].choice[j];
a[i].g3=(a[i].g1+a[i].g2)/2;
a[i].id=i;
}
for(int i=1;i<OL1;i++)//对成绩进行排序，GE高的放在前面
{
int j;
for(j=0;j<i;j++)
{
if(a[i].g3>a[j].g3)
{
apl temp=a[i];
for(int k=i-1;k>=j;k--)
a[k+1]=a[k];
a[j]=temp;
}else
if(a[i].g3==a[j].g3)
{
if(a[i].g1>a[j].g1)
{
apl temp=a[i];
for(int k=i-1;k>=j;k--)
a[k+1]=a[k];
a[j]=temp;
}
}
}
}
int count=1;
a[0].rank=1;
for(int i=1;i<OL1;i++)//对排名进行统计
{
if(a[i].g3==a[i-1].g3)
{
if(a[i].g1==a[i-1].g1)
{
a[i].rank=count;
}
else
{
++count;
a[i].rank=count;
}
}
else
{
++count;
a[i].rank=count;
}
}
for(int i=0;i<OL1;i++)//对每个学校招生进行统计
{
int j=0;
int ranks;
while(a[i].choice[j]!=-1)
{
int s=a[i].choice[j];//当前想去的学校
if(b[s].n1<b[s].n && b[s].n>0)//名额未满
{
b[s].n1++;
b[s].apl_id[b[s].n1].ID=a[i].id;
b[s].apl_id[b[s].n1].ranks=a[i].rank;
break;
}else if(b[s].n1>=b[s].n && b[s].apl_id[b[s].n1].ranks==a[i].rank && b[s].n>0 )//排名并列情况
{
b[s].n1++;
b[s].apl_id[b[s].n1].ID=a[i].id;
b[s].apl_id[b[s].n1].ranks=a[i].id;
break;
}
j++;
}
}
for(int i=0;i<OL2;i++)//对每个学校录取学生的id进行排序
{
if(b[i].n1>1)
{
for(int j=2;j<=b[i].n1;j++)
{
for(int k=1;k<j;k++)
{
if(b[i].apl_id[j].ID<b[i].apl_id[k].ID)
{
int t=b[i].apl_id[j].ID;
for(int l=j-1;l>=k;l--)
b[i].apl_id[l+1].ID=b[i].apl_id[l].ID;
b[i].apl_id[k].ID=t;
}
}
}
}
}
for(int i=0;i<OL2;i++)
{
if(b[i].n1>0)
{
for(int j=1;j<=b[i].n1;j++)
{
cout<<b[i].apl_id[j].ID;
if(j!=b[i].n1)
cout<<" ";
}
}
cout<<endl;
}
}
return 0;
} 另外一种使用STL库函数的排序函数sort();头文件algorithm
（二）c++标准库里的排序函数的使用方法
I）Sort函数包含在头文件为#include的c++标准库中，调用标准库里的排序方法可以不必知道其内部是如何实现的，只要出现我们想要的结果即可！
II）Sort函数有三个参数：
（1）第一个是要排序的数组的起始地址。
（2）第二个是结束的地址（最后一位要排序的地址）
（3）第三个参数是排序的方法，可以是从大到小也可是从小到大，还可以不写第三个参数，此时默认的排序方法是从小到大排序。
Sort函数使用模板:
Sort(start,end,排序方法)
下面就具体使用sort（）函数结合对数组里的十个数进行排序做一个说明！
bool compare(int a,int b)
{
return a<b; //升序排列，如果改为return a>b，则为降序
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[20]={2,4,1,23,5,76,0,43,24,65},i;
for(i=0;i<20;i++)
cout<<a[i]<<endl;
sort(a,a+20,compare);
for(i=0;i<20;i++)
cout<<a[i]<<endl;
return 0;
}#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
typedef struct apl
{
int g1;
int g2;
int g3;
int id;
int rank;
int choice[5];
}apl;
typedef struct app
{
int ID;
int ranks;
}app;
typedef struct sch
{
int n;//最大招收人数
int n1;//实际招收人数
app apl_id[4001]; // 招收人的id
}sch;
apl a[40000];
sch b[100];
int cmp1(const apl &apl1,const apl &apl2)//排序函数的第三个参数 ,用来对排名次
{
if(apl1.g3!=apl2.g3)
return apl1.g3>apl2.g3;
else if(apl1.g1!=apl2.g1)
return apl1.g1>apl2.g1;
}
int cmp2(const app &sch1,const app &sch2)//排序函数的第三个参数 ,用来对考号进行排名
{
return sch1.ID<sch2.ID;
}
int main()
{
ifstream in;
in.open("2.txt");
int OL1,OL2,OL3;
for(int i=0;i<40000;i++)
for(int j=0;j<5;j++)
a[i].choice[j]=-1;
while(in>>OL1>>OL2>>OL3)
{
for(int i=0;i<OL2;i++)
{
in>>b[i].n;
b[i].n1=0;
}
for(int i=0;i<OL1;i++)
{
in>>a[i].g1>>a[i].g2;
for(int j=0;j<OL3;j++)
in>>a[i].choice[j];
a[i].g3=(a[i].g1+a[i].g2)/2;
a[i].id=i;
}
sort(a,a+OL1,cmp1);//调用排序函数对成绩进行排序，如果总成绩相等再比较GE
// for(int i=1;i<OL1;i++)//对成绩进行排序
// {
// int j;
// for(j=0;j<i;j++)
// {
// if(a[i].g3>a[j].g3)
// {
// apl temp=a[i];
// for(int k=i-1;k>=j;k--)
// a[k+1]=a[k];
// a[j]=temp;
// }else
// if(a[i].g3==a[j].g3)
// {
// if(a[i].g1>a[j].g1)
// {
// apl temp=a[i];
// for(int k=i-1;k>=j;k--)
// a[k+1]=a[k];
// a[j]=temp;
// }
// }
// }
// }
int count=1;
a[0].rank=1;
for(int i=1;i<OL1;i++)//对排名进行统计
{
if(a[i].g3==a[i-1].g3)
{
if(a[i].g1==a[i-1].g1)
{
a[i].rank=count;
}
else
{
++count;
a[i].rank=count;
}
}
else
{
++count;
a[i].rank=count;
}
}
for(int i=0;i<OL1;i++)//对每个学校招生进行统计
{
int j=0;
int ranks;
while(a[i].choice[j]!=-1)
{
int s=a[i].choice[j];//当前想去的学校
if(b[s].n1<b[s].n && b[s].n>0)//名额未满
{
b[s].n1++;
b[s].apl_id[b[s].n1].ID=a[i].id;
b[s].apl_id[b[s].n1].ranks=a[i].rank;
break;
}else if(b[s].n1>=b[s].n && b[s].apl_id[b[s].n1].ranks==a[i].rank && b[s].n>0 )//并列情况
{
b[s].n1++;
b[s].apl_id[b[s].n1].ID=a[i].id;
b[s].apl_id[b[s].n1].ranks=a[i].id;
break;
}
j++;
}
}
for(int i=0;i<OL2;i++)//对每个学校录取学生的id进行排序
{
if(b[i].n1>1)
{
sort(b[i].apl_id+1,b[i].apl_id+b[i].n1+1,cmp2);
// for(int j=2;j<=b[i].n1;j++)
// {
// for(int k=1;k<j;k++)
// {
// if(b[i].apl_id[j].ID<b[i].apl_id[k].ID)
// {
// int t=b[i].apl_id[j].ID;
// for(int l=j-1;l>=k;l--)
// b[i].apl_id[l+1].ID=b[i].apl_id[l].ID;
// b[i].apl_id[k].ID=t;
// }
// }
// }
}
}
for(int i=0;i<OL2;i++)
{
if(b[i].n1>0)
{
for(int j=1;j<=b[i].n1;j++)
{
cout<<b[i].apl_id[j].ID;
if(j!=b[i].n1)
cout<<" ";
}
}
cout<<endl;
}
}
return 0;
} 
扫一扫
571
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
