#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int maxv=100010;
struct person{
char name[10];
int age;
int worth;
};
vector<person> node;
bool cmp(person a,person b){
if(a.worth!=b.worth){
return a.worth>b.worth;
}else if(a.age!=b.age){
return a.age<b.age;
}else{
return strcmp(a.name,b.name)<0;
}
}
int main(){
int n,k;
scanf("%d %d",&n,&k);
for(int i=0;i<n;i++){
person temp;
scanf("%s %d %d",temp.name,&temp.age,&temp.worth);
node.push_back(temp);
}
sort(node.begin(),node.end(),cmp);
for(int i=1;i<=k;i++){
int number,mina,maxa;
printf("Case #%d:\n",i);
scanf("%d %d %d",&number,&mina,&maxa);
int index=0,cnt=0;
while(cnt<number&&index<n){
if(node[index].age>=mina&&node[index].age<=maxa){
printf("%s %d %d\n",node[index].name,node[index].age,node[index].worth);
cnt++;
}
index++;
}
if(cnt==0){
printf("None\n");
}
}
return 0;
}
pat a 1055
最新推荐文章于 2022-04-20 21:29:21 发布