#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct Person
{
char name[9];
int age;
int worth;
};
struct Comp
{
bool operator()(Person const &per_a,Person const &per_b)
{
if(per_a.worth==per_b.worth)
{
if(per_a.age==per_b.age)
{
return strcmp(per_a.name,per_b.name)<0;
}
return per_a.age<per_b.age;
}
return per_a.worth>per_b.worth;
}
};
int main()
{
// freopen("C:\\Users\\Frank Wang\\Desktop\\in.txt","r",stdin);
int n,m;
// cin>>n>>m;
scanf("%d%d",&n,&m);
Person arr[n];
for(int i=0;i<n;++i)
{
// cin>>arr[i].name>>arr[i].age>>arr[i].worth;
scanf("%s%d%d",arr[i].name,&arr[i].age,&arr[i].worth);
}
sort(arr,arr+n,Comp());
// bool mark[n];
// memset(mark,0,sizeof(mark));
int cnt[201]={0};
/* for(int i=0;i<n;++i)
{
++cnt[arr[i].age];
if(cnt[arr[i].age]>100)
{
mark[i]=1;
}
}
*/
int b[n];
int j=0;
for(int i=0;i<n;++i)
{
if(cnt[a[i].age]<100)
{
b[j++]=i;
++cnt[a[i].age];
}
}
for(int i=0;i<m;++i)
{
printf("Case #%d:\n",i+1);
// cout<<"Case #"<<i+1<<":"<<endl;
int output_n,amin,amax;
scanf("%d%d%d",&output_n,&amin,&amax);
// cin>>output_n>>amin>>amax;
bool flag=0;
for(int ii=0;ii<j&&output_n!=0;++ii)
{
// if(mark[j]) continue;
if(arr[b[ii]].age<=amax&&arr[b[ii]].age>=amin)
{
if(flag==0) flag=1;
printf("%s %d %d\n",arr[b[ii]].name,arr[b[ii]].age,arr[b[ii]].worth);
// cout<<arr[j].name<<' '<<arr[j].age<<' '<<arr[j].worth<<endl;
--output_n;
}
}
if(flag==0) //cout<<"None"<<endl;
printf("None\n");
}
}
pat 1055 how to improve the performance
最新推荐文章于 2021-02-28 21:50:00 发布