PAT_1080. Graduate Admission

#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
struct Student
{
	int id;
	int GE,GI;
	int choice[10];
	int rank;
}stu[40005];
int N,M,K;
int quota[105],nowQuota[105];
vector<int> school[105];
vector<Student> s[40005];
int cmp(Student a,Student b)
{
	if(a.GE+a.GI==b.GE+b.GI)
		return a.GE>b.GE;
	return a.GE+a.GI>b.GE+b.GI;
}
int main()
{
	memset(nowQuota,0,sizeof(nowQuota));
	scanf("%d%d%d",&N,&M,&K);
	for(int i=0;i<M;i++)
		scanf("%d","a[i]);
	for(int i=0;i<N;i++)
	{
		stu[i].id=i;
		scanf("%d%d",&stu[i].GE,&stu[i].GI);
		for(int j=0;j<K;j++)
			scanf("%d",&stu[i].choice[j]);
	}
	sort(stu,stu+N,cmp);
	//cout<<"---"<<endl;
	for(int i=0;i<N;i++)
	{
		stu[i].rank=i+1;
		if(i!=0&&stu[i].GE+stu[i].GI==stu[i-1].GE+stu[i-1].GI&&stu[i].GE==stu[i-1].GE)
			stu[i].rank=stu[i-1].rank;
		//cout<<stu[i].id<<" rank "<<stu[i].rank<<" "<<stu[i].GE<<" "<<stu[i].GI<<endl;
	}
	int cnt=-1;
	for(int i=0;i<N;i++)
	{
		if(i!=0&&stu[i].rank==stu[i-1].rank)
			s[cnt].push_back(stu[i]);
		else
			s[++cnt].push_back(stu[i]);
	}
	for(int i=0;i<=cnt;i++)
	{
		int temp[105];
		memset(temp,0,sizeof(temp));
		//cout<<"rank:"<<i+1<<endl;
		for(int j=0;j<s[i].size();j++)
		{
			for(int k=0;k<K;k++)
			{
				if(nowQuota[s[i][j].choice[k]]<quota[s[i][j].choice[k]])
				{
					school[s[i][j].choice[k]].push_back(s[i][j].id);
					temp[s[i][j].choice[k]]++;
					break;
				}
			}
			//cout<<s[i][j].id<<" ";
		}
		for(int j=0;j<105;j++)
			nowQuota[j]+=temp[j];
		//cout<<endl;
	}
	for(int i=0;i<M;i++)
	{
		sort(school[i].begin(),school[i].end());
		for(int j=0;j<school[i].size();j++)
		{
			if(j==0)
				cout<<school[i][j];
			else
				cout<<" "<<school[i][j];
		}
		cout<<endl;
	}
	return 0;
}

 

模拟题，45分钟一次过。。下班之前写好了23333333333