1062 Talent and Virtue

#include<bits/stdc++.h>
using namespace std;
const int MAXN=100001;
struct Node{
	int id;
	int talent;
	int virtue;
	int rank;
	int total;
	int flag;
}node[MAXN];
bool cmp(Node a,Node b){
	if(a.flag!=b.flag) return a.flag>b.flag;
	else if(a.total!=b.total) return a.total>b.total;
	else if(a.virtue!=b.virtue) return a.virtue>b.virtue;
	else return a.id<b.id;
}
int main()
{
	int n,l,h;
	//cin>>n>>l>>h;
	scanf("%d%d%d",&n,&l,&h);
	int cnt=0;
	for(int i=0;i<n;i++){
		int idd,talents,virtues;
		//cin>>idd>>virtues>>talents;
		scanf("%d%d%d",&idd,&virtues,&talents);
		if(talents>=l&&virtues>=l){
			node[cnt].id=idd;
			node[cnt].talent=talents;
			node[cnt].virtue=virtues;
			node[cnt].total=node[cnt].virtue+node[cnt].talent;
			if(node[cnt].talent>=h&&node[cnt].virtue>=h){
				node[cnt].flag=4;
			}else if(node[cnt].virtue>=h&&node[cnt].talent<h){
				node[cnt].flag=3;
			}else if(node[cnt].virtue<h&&node[cnt].talent<h&&node[cnt].virtue>=node[cnt].talent){
				node[cnt].flag=2;
			}else{
				node[cnt].flag=1;
			}
			cnt++;
		}
	}
	sort(node,node+cnt,cmp);//cout<<cnt<<endl;
	printf("%d\n",cnt);
	for(int i=0;i<cnt;i++){
		printf("%08d %d %d\n",node[i].id,node[i].virtue,node[i].talent);
	}
	return 0;
}