A1062 Talent and Virtue (25)

#include<cstdio>
#include<algorithm>

using namespace std;

struct Grade{
int num,de,cai,sum,flag;
}stu[100010];
bool cmp(Grade a,Grade 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 a.num < b.num;
}
int main(){
int n,l,h,m = 0;
scanf("%d %d %d",&n,&l,&h);
for(int i  =0;i < n;i++){
scanf("%d %d %d",&stu[i].num,&stu[i].de,&stu[i].cai);
stu[i].sum = stu[i].de + stu[i].cai;
if(stu[i].de>=h && stu[i].cai >= h) stu[i].flag = 1;
else if(stu[i].de >= h&&stu[i].cai >= l&&stu[i].cai<h) stu[i].flag = 2;
else if(stu[i].cai>=l&&stu[i].cai< h && stu[i].de>=stu[i].cai&&stu[i].de>=l&&stu[i].de<h) stu[i].flag = 3;
else if(stu[i].de<l || stu[i].cai < l){
stu[i].flag = 5;
}
else stu[i].flag = 4;
}
sort(stu,stu+n,cmp);
while(stu[m].flag<5 && m<=n) m++;
printf("%d\n",m);
for(int i = 0;i < m;i++)
printf("%d %d %d\n",stu[i].num,stu[i].de,stu[i].cai);
return 0;
}