B1015/A1062 德才論

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct student{
	char num[10];
	int de,cai,sum,sign,r;
}s[100105];
bool cmp(student a,student b){
	if(a.sign!=b.sign) return a.sign<b.sign;
	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.num,b.num)<0; 
	
}
int main(){
	int i,j,k,m=0,n=0,l,h;
	scanf("%d %d %d",&n,&l,&h);
	for(i=0;i<n;i++){
		scanf("%s %d %d",s[i].num,&s[i].de,&s[i].cai);
		if(s[i].de>=l&&s[i].cai>=l)m++; 
		if(s[i].de<l||s[i].cai<l) s[i].sign=5;
		if(s[i].cai>=h&&s[i].de>=h) {s[i].sign=1;}
		else if(s[i].cai<=h&&s[i].cai>=l&&s[i].de>=h){s[i].sign=2;}
		else if(s[i].cai<=h&&s[i].de<=h&&s[i].cai>=l&&s[i].de>=l&&s[i].cai<=s[i].de){s[i].sign=3;}
		else {s[i].sign=4;}
		s[i].sum=s[i].de+s[i].cai;
	}
	sort(s,s+n,cmp);
	printf("%d\n",m);
	for(i=0;i<m;i++){
		printf("%s %d %d\n",s[i].num,s[i].de,s[i].cai);
	}
	return 0;	
}