B1015/A1062 德才论

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct student
{
	char id[10];
	int de,cai,sum;
	int flag;
}stu[100010];
bool cmp(student a,student b)
{
	if(a.flag!=b.flag) return a.flag<b.flag;
	else if(a.sum!=b.sum) return a.sum>b.sum;
	else if(a.de!=b.de) return a.de>b.de;
	else return strcmp(a.id,b.id)<0;
}
int main()
{
	int n,low,high;
	scanf("%d%d%d\n",&n,&low,&high);
	int m=n;    ///先输入n才能把其值赋给啊，怎么可以颠倒？？？ 
	for(int i=0;i<n;i++)
	{
		scanf("%s%d%d",stu[i].id,&stu[i].de,&stu[i].cai);
		stu[i].sum=stu[i].de+stu[i].cai;
		if(stu[i].de<low||stu[i].cai<low)///是或 
		{
			stu[i].flag=5;
			m--;
		}else if(stu[i].de>=high&stu[i].cai>=high)
		{
			stu[i].flag=1;
		}else if(stu[i].de>=high&stu[i].cai<high)
		{
			stu[i].flag=2;	
		}else if(stu[i].de>=stu[i].cai)
		{
			stu[i].flag=3;	
		}else
		{
			stu[i].flag=4;	
		}	
	}
	sort(stu,stu+n,cmp);
	printf("%d\n",m);
	for(int i=0;i<m;i++)
	{
		printf("%s %d %d\n",stu[i].id,stu[i].de,stu[i].cai);
	}
	return 0;
}