PAT 1055

#include<cstdio>#include<algorithm>#include<stdlib.h>#include<cstring>using namespace std;struct richer{	char name[10];	int age;	int worth; }valid[100010],rich[100010];bool cmp(richer x,richer y){	if(x.worth!=y.worth)		return x.worth>y.worth;	else if(x.age!=y.age)		return x.age<y.age;	else return strcmp(x.name,y.name)<0;}int main(){	int n,m;	scanf("%d%d",&n,&m);	for(int i=1;i<=n;i++)	{		scanf("%s%d%d",rich[i].name,&rich[i].age,&rich[i].worth);	}	sort(rich+1,rich+1+n,cmp);	int age[201]={0};	int valid_num=0;	for(int i=1;i<=n;i++)	{		if(age[rich[i].age]<100)		{			valid[valid_num++]=rich[i];			age[rich[i].age]++;		}	}	int k,ageL,ageH;	for(int i=1;i<=m;i++)	{		int PRintnum=0;		scanf("%d%d%d",&k,&ageL,&ageH);		printf("Case #%d:/n",i);		for(int j=0;j<valid_num&&printnum<k;j++)		{			if(valid[j].age>=ageL&&valid[j].age<=ageH)			{				printf("%s %d %d/n",valid[j].name,valid[j].age,valid[j].worth);				printnum++;			}		}		if(printnum==0)		{			printf("None/n");		}	}	system("pause");	return 0;}