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_Worth
The 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 50
Sample 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
/*
输入n个富豪的信息,k个查询
信息包括 姓名 年龄 资产
查询包括 查询人数 年龄段
递减输出每个年龄段的 资产
总是钱最多的 输出在前
资产相同 输出年龄大的
年龄资产相同 按字典序输出
注意:每次查询要求输出年龄范围内 前m人的信息 m最大为100
*/
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int maxn = 100005;
int Age[maxn] = {0}; //某年龄的人数
struct Richest {
string name;
int age;
int worth;
}ric[maxn], valid[maxn]; //valid保存各自年龄中财富值在100名以内的人
bool cmp1(Richest a, Richest b) {
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() {
//ios::sync_with_stdio(false);
int n, k;
// cin >> n >> k;
scanf("%d%d", &n,&k);
for (int i = 0; i < n; i++) {
//cin >> ric[i].name >> ric[i].age >> ric[i].worth;
ric[i].name.resize(10); //需要预留空间 才能用scanf输入string
scanf("%s%d%d", &ric[i].name[0], &ric[i].age, &ric[i].worth);
}
sort(ric, ric + n, cmp1); //排完序后 钱最多的在最前面 递减的顺序
/*
注意到m的范围仅在100以内,因此可以预处理,即将每个年龄中财富在前100名以内的人全部都存到另一个数组中
因为某个年龄张财富值在100名以外的人永远不会被输出,后面查询的操作均在这个新数组中进行。
这个预处理操作将显著降低查询的复杂度,使得k次查询不会超时
*/
int validNum = 0; //存放到valid数组中的人数
for(int i=0; i<n; i++){
if(Age[ric[i].age] < 100){ //年龄ric[i].age的人数小于100时
Age[ric[i].age]++; //将此年龄的人数加1
valid[validNum++] = ric[i]; //将ric[i]加入新数组中
}
}
int query, Amin, Amax;
for (int i = 0; i < k; i++) {
cin >> query >> Amin >> Amax;
//cout << "Case #" << i + 1 << ":" << endl;
printf("Case #%d:\n", i + 1);
int count = 0, j = 0;
while (count != query && j < n) {
if (valid[j].age >= Amin && valid[j].age <= Amax) {
count++;
//cout << ric[j].name << " " << ric[j].age << " " << ric[j].worth << endl;
printf("%s %d %d\n", valid[j].name.c_str(), valid[j].age, valid[j].worth);
}
j++;
}
if (!count) {
printf("None\n");
}
}
return 0;
}