1055. The World's Richest (25)
Forbes magazine publishes every year its list of billionaires based on the annual ranking of the world's wealthiest people. Now you are supposed to simulate this job, but concentrate only on the people in a certain range of ages. That is, given the net worths of N people, you must find the M richest people in a given range of their ages.
Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers: N (<=105) - the total number of people, and K (<=103) - the number of queries. Then N lines follow, each contains the name (string of no more than 8 characters without space), age (integer in (0, 200]), and the net worth (integer in [-106, 106]) of a person. Finally there are K lines of queries, each contains three positive integers: M (<= 100) - the maximum number of outputs, and [Amin, Amax] which are the range of ages. All the numbers in a line are separated by a space.
Output Specification:
For each query, first print in a line "Case #X:" where X is the query number starting from 1. Then output the M richest people with their ages in the range [Amin, Amax]. Each person's information occupies a line, in the format
Name Age Net_WorthThe outputs must be in non-increasing order of the net worths. In case there are equal worths, it must be in non-decreasing order of the ages. If both worths and ages are the same, then the output must be in non-decreasing alphabetical order of the names. It is guaranteed that there is no two persons share all the same of the three pieces of information. In case no one is found, output "None".
Sample Input:
12 4 Zoe_Bill 35 2333 Bob_Volk 24 5888 Anny_Cin 95 999999 Williams 30 -22 Cindy 76 76000 Alice 18 88888 Joe_Mike 32 3222 Michael 5 300000 Rosemary 40 5888 Dobby 24 5888 Billy 24 5888 Nobody 5 0 4 15 45 4 30 35 4 5 95 1 45 50Sample Output:
Case #1: Alice 18 88888 Billy 24 5888 Bob_Volk 24 5888 Dobby 24 5888 Case #2: Joe_Mike 32 3222 Zoe_Bill 35 2333 Williams 30 -22 Case #3: Anny_Cin 95 999999 Michael 5 300000 Alice 18 88888 Cindy 76 76000 Case #4: None
最开始思路是用priority_queue把符合年龄的插进去。速度不错，尤其是point2只要140ms，但是point3超时，估计是K(query times)比较大？
代码如下：
#include<string>
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<queue>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
struct ZZ{
string name;
int age;
int worth;
}node[100001];
struct cmp{
bool operator() (ZZ A,ZZ B) const
{
if(A.worth!=B.worth)
return A.worth<B.worth;
else if(A.age!=B.age)
return A.age>B.age;
else return A.name>B.name;
}
};
int main()
{
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++)
{
char tmp[10];
scanf("%s %d %d",tmp,&node[i].age,&node[i].worth);
node[i].name=tmp;
}
for(int i=1;i<=k;i++)
{
int x,y,z;
scanf("%d %d %d",&x,&y,&z);
printf("Case #%d:\n",i);
priority_queue<ZZ,vector<ZZ>,cmp> Q;
for(int j=0;j<n;j++)
if(node[j].age<=z&&node[j].age>=y)
Q.push(node[j]);
if(Q.size()==0) cout<<"None"<<endl;
else
for(int j=0;j<x;j++)
{
if(Q.size()==0) break;
ZZ tmmp=Q.top();
Q.pop();
printf("%s %d %d\n",tmmp.name.c_str(),tmmp.age,tmmp.worth);
/// cout<<tmmp.name<<' '<<tmmp.age<<' '<<tmmp.worth<<endl;
}
}
return 0;
}
后来改成把node全部排序。每次都从头到尾搜索符合年龄的输出之。
#include<string>
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<queue>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
struct ZZ{
string name;
int age;
int worth;
bool operator < (const ZZ &B) const
{
if(worth!=B.worth)
return worth>B.worth;
else if(age!=B.age)
return age<B.age;
else return name<B.name;
}
}node[100001];
int main()
{
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++)
{
char tmp[10];
scanf("%s %d %d",tmp,&node[i].age,&node[i].worth);
node[i].name=tmp;
}
sort(node,node+n);
for(int i=1;i<=k;i++)
{
int x,y,z;
scanf("%d %d %d",&x,&y,&z);
printf("Case #%d:\n",i);
int pp=0;
for(int j=0;j<n;j++)
if(node[j].age<=z&&node[j].age>=y)
{
printf("%s %d %d\n",node[j].name.c_str(),node[j].age,node[j].worth);
pp++;
if(pp==x) break;
}
if(pp==0) cout<<"None"<<endl;
}
return 0;
}