A1080 Graduate Admission

做了半天，到处丢东西，太宝贵的一道题

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
struct student
{
	int id,GI,GE,grade,rank;
	vector<int> vschool;
};
struct school
{
	int maxnum,nownum,lastrank;
	vector<int> stuID;
};
bool cmp(student a,student b)
{
	return a.grade!=b.grade?a.grade>b.grade:a.GE>b.GE;
}

int main()
{
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	vector<student> stu(n);
	vector<school> sch(m);
	for(int i=0;i<m;i++)
	{
		scanf("%d",&sch[i].maxnum);
		sch[i].nownum=0;
		sch[i].lastrank=-1;
	}
	for(int i=0;i<n;i++)
	{
		stu[i].id=i;
		scanf("%d%d",&stu[i].GE,&stu[i].GI);
		stu[i].grade=stu[i].GE+stu[i].GI;
	    stu[i].vschool.resize(k);///****找了两小时，否则停止运行 
		for(int j=0;j<k;j++)
		{
			scanf("%d\n",&stu[i].vschool[j]); 
		}
	}
	sort(stu.begin(),stu.end(),cmp);
	stu[0].rank=1;
	for(int i=1;i<n;i++)
	{
		if((stu[i].grade==stu[i-1].grade)&&stu[i].GE==stu[i-1].GE)  stu[i].rank=stu[i-1].rank;
		else stu[i].rank=i+1;
	}
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<k;j++)
		{
			int schoolID=stu[i].vschool[j];
			int myrank=stu[i].rank;
			int myID=stu[i].id;
			if((sch[schoolID].nownum<sch[schoolID].maxnum)||(sch[schoolID].lastrank==myrank))
			{
				sch[schoolID].nownum++;
				sch[schoolID].lastrank=myrank;
				sch[schoolID].stuID.push_back(myID);
				break;///***必须，被录取了还算啥？ 
			}	
		}
	}
	for(int i=0;i<m;i++)
	{
		sort(sch[i].stuID.begin(),sch[i].stuID.end());
		for(int j=0;j<sch[i].stuID.size();j++)
		{	
			printf("%d ",sch[i].stuID[j]);
			if(j<sch[i].stuID.size()-1) printf(" ");
		}
			printf("\n");
	}
		return 0;
}