A1055. The World's Richest (25)

#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

struct Pl{
char name[9];
int age,wealth;
}pl[100010];
bool cmp(Pl a,Pl b){
int t = strcmp(a.name,b.name);
if(a.wealth!=b.wealth) return a.wealth > b.wealth;
else if(a.age!=b.age) return a.age < b.age;
else return t < 0;
}
int main(){
int n,k,q,start,end;
scanf("%d %d",&n,&k);
for(int i = 0;i < n;i++){
scanf("%s %d %d",pl[i].name,&pl[i].age,&pl[i].wealth);
}
sort(pl,pl+n,cmp);
for(int i = 0;i < k;i++){
scanf("%d %d %d",&q,&start,&end);
printf("Case #%d:\n",i+1);
int p = q;
for(int i = 0;i < n;i++){
if(pl[i].age>=start&&pl[i].age<=end){
printf("%s %d %d\n",pl[i].name,pl[i].age,pl[i].wealth);
p--;
}
if(!p) break;
}
if(p==q) printf("None\n");
}
return 0;
}