//
// main.cpp
// PAT_ 1055. The World's Richest
//
// Created by wjq on 17/5/15.
// Copyright © 2017年 wjq. All rights reserved.
//
#include <iostream>
#include <algorithm>
using namespace std;
struct record
{
string name;
int age,worths;
}r[100005];
int N,K,outputnum,Amin,Amax;
char str[10];
int cmpall(record a,record b)
{
if(a.worths==b.worths)
{
if(a.age==b.age)
return a.name<b.name;
else
return a.age<b.age;
}
else
return a.worths>b.worths;
}
int main(int argc, const char * argv[])
{
scanf("%d%d",&N,&K);
for(int i=0;i<N;i++)
{
scanf("%s%d%d",str,&r[i].age,&r[i].worths);
r[i].name=str;
}
sort(r,r+N,cmpall);
for(int i=0;i<K;i++)
{
scanf("%d%d%d",&outputnum,&Amin,&Amax);
int temp=outputnum;
cout<<"Case #"<<i+1<<":"<<endl;
for(int j=0;j<N&&temp!=0;j++)
{
if(r[j].age>=Amin&&r[j].age<=Amax&&temp--)
cout<<r[j].name<<" "<<r[j].age<<" "<<r[j].worths<<endl;
}
if(temp==outputnum)
cout<<"None";
}
return 0;
}
pat常见套路题,排序.