1015（待优化，未通过）

#include<stdio.h>
struct stu{
int xh;
int df;
int cf;
}stu[100000+2];
int main()
{
int n,i,t;
int d,c;
int j=0,k;
scanf("%d%d%d",&n,&d,&c);
for(i=0;i<n;i++){
scanf("%d",&stu[i].xh);
scanf("%d",&stu[i].df);
scanf("%d",&stu[i].cf);
}

for(i=0;i<n;i++){
if(stu[i].df<d || stu[i].cf<c)
  {j++;for(k=i;k<n;k++)
  {stu[k].df=stu[k+1].df;
  stu[k].cf=stu[k+1].cf;}
}
else if((stu[i].df+stu[i].cf)<(stu[i+1].df+stu[i+1].cf))
{ t=stu[i].df;stu[i].df=stu[i+1].df;
stu[i+1].df=t; t=stu[i].cf;stu[i].cf=stu[i+1].cf;
stu[i+1].cf=t;t=stu[i].xh;stu[i].xh=stu[i+1].xh;
stu[i+1].xh=t;
}
else if((stu[i].df+stu[i].cf)==(stu[i+1].df+stu[i+1].cf))
{
if(stu[i].df<stu[i+1].df)
{ t=stu[i].df;stu[i].df=stu[i+1].df;
stu[i+1].df=t; t=stu[i].cf;stu[i].cf=stu[i+1].cf;
stu[i+1].cf=t;t=stu[i].xh;stu[i].xh=stu[i+1].xh;
stu[i+1].xh=t;
}
}
}n=n-j;
printf("%d\n",n);
for(i=0;i<n;i++){
printf("%d %d %d\n", stu[i].xh, stu[i].df,stu[i].cf); 
}
}