1062 ||写成&&

版权声明：// Copyright © 2018年 Coding18. All rights reserved. https://blog.csdn.net/Coding18/article/details/86608071

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct student{
	int id;
	int v,t;
	int flag;
}stu[100010];
bool cmp(student a,student b)
{
	if(a.flag != b.flag ) return a.flag > b.flag;
	else if((a.v+a.t) != (b.v + b.t)) return (a.v+a.t) > (b.v + b.t);
	else if(a.v != b.v) return a.v > b.v;
	else return a.id < b.id;
}
int main()
{
	int n,l,h;
	int num = 0;
	scanf("%d %d %d",&n,&l,&h);
	for(int i = 0; i < n; i++)
	{
		scanf("%d %d %d",&stu[i].id,&stu[i].v,&stu[i].t);
		if(stu[i].t < l || stu[i].v < l)
		{
			num++;
			stu[i].flag = 1;
		}
		else if(stu[i].t >= h && stu[i].v >= h)
		stu[i].flag = 5;
		else if(stu[i].t < h && stu[i].v >= h)
		stu[i].flag = 4;
		else if(stu[i].t < h && stu[i].v < h && stu[i].v >= stu[i].t)
		stu[i].flag = 3;
		else stu[i].flag = 2;
	}
	sort(stu,stu+n,cmp);
	printf("%d\n",n-num);
	for(int i  = 0; i < (n-num); i++)
	{
		printf("%d %d %d\n",stu[i].id,stu[i].v,stu[i].t);
	}
	return 0;
}