PAT 1015 德才论

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;

struct ss
{
int number;
int de;
int cai;
};
bool comp(ss a,ss b);
int main()
{

int N,l,h;
int i,j,m,n,k;
int count=0;
scanf("%d%d%d",&N,&l,&h);
ss str
;
ss str1
;
ss str2
;
ss str3
;
ss str4
;
for(i=0,j=0,m=0,n=0,k=0;i<N;i++){
scanf("%d%d%d",&str[i].number,&str[i].de,&str[i].cai);
if(str[i].de>=l&&str[i].cai>=l){
count++;
if(str[i].de>=h&&str[i].cai>=h)  {
str1[j]=str[i];j++;
}else if(str[i].de>=h&&str[i].cai<=h)  {
str2[m]=str[i];m++;
}else if(str[i].de<=h&&str[i].cai<=h&&str[i].de>=str[i].cai) {
str3
=str[i];n++;
}else{
str4[k]=str[i];k++;
}
}
}
sort(str1,str1+j,comp);
sort(str2,str2+m,comp);
sort(str3,str3+n,comp);
sort(str4,str4+k,comp);
printf("%d\n",count);
for(i=0;i<j;i++){
printf("%d %d %d\n",str1[i].number,str1[i].de,str1[i].cai);
}
for(i=0;i<m;i++){
printf("%d %d %d\n",str2[i].number,str2[i].de,str2[i].cai);
}
for(i=0;i<n;i++){
printf("%d %d %d\n",str3[i].number,str3[i].de,str3[i].cai);
}
for(i=0;i<k;i++){
printf("%d %d %d\n",str4[i].number,str4[i].de,str4[i].cai);
}
return 0;
}
bool comp(ss a,ss b)
{
if(a.de+a.cai!=b.de+b.cai){
return a.de+a.cai>b.de+b.cai;
}
else{
if(a.de!=b.de)
return a.de>b.de;
else{
return a.number<b.number;
}
}
}