标签：24 1055 people int age Richest netWorth World 5888
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 (≤) - the total number of people, and K (≤) - 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 [−]) of a person. Finally there are K lines of queries, each contains three positive integers: M (≤) - 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题意：
按照所给的要求排序。
思路：
最朴素的方法就是先按照年龄排序，然后再将所在年龄区间的人数再次排序。但是这样做的话有一组数据会超时。看了别人的blog后发现，问题出在每次查询的人数k < 100. 如果将所有满足要求年龄区间的人数都算进去的话，数字要远大于100，所以要先进行预处理，即先按照要求排序，再将让每一个年龄的人数最多有一百个。这样处理过之后，如果用cin和cout还是有一组数据过不了，换成scanf和printf就能够通过了。但是换过之后有一个比较容易卡到的点就是比较两个char数组的方法，这里我们使用strcmp()函数。
C 库函数 int strcmp(const char *str1, const char *str2) 把 str1 所指向的字符串和 str2 所指向的字符串进行比较。
该函数返回值如下：
- 如果返回值小于 0，则表示 str1 小于 str2。
- 如果返回值大于 0，则表示 str1 大于 str2。
- 如果返回值等于 0，则表示 str1 等于 str2。
Code：
1 #include <bits/stdc++.h>
2
3 using namespace std;
4
5 struct People {
6 char name[10];
7 int age;
8 int netWorth;
9 };
10
11 bool cmp(People a, People b) {
12 if (a.netWorth != b.netWorth)
13 return a.netWorth > b.netWorth;
14 else if (a.age != b.age)
15 return a.age < b.age;
16 else
17 return (strcmp(a.name, b.name) < 0);
18 }
19
20 int main() {
21 int n, k;
22 scanf("%d%d", &n, &k);
23 vector<People> v(n);
24 for (int i = 0; i < n; ++i)
25 scanf("%s%d%d", v[i].name, &v[i].age, &v[i].netWorth);
26 sort(v.begin(), v.end(), cmp);
27 vector<People> temp;
28 vector<int> nums(205, 0);
29 for (int i = 0; i < n; ++i) {
30 if (nums[v[i].age] < 100) {
31 temp.push_back(v[i]);
32 nums[v[i].age]++;
33 }
34 }
35 int m, Amin, Amax, cnt = 1;
36 while (cnt <= k) {
37 scanf("%d%d%d", &m, &Amin, &Amax);
38 vector<People> res;
39 for (int i = 0; i < temp.size(); ++i) {
40 if (temp[i].age >= Amin && temp[i].age <= Amax)
41 res.push_back(temp[i]);
42 }
43 printf("Case #%d:\n", cnt++);
44 for (int i = 0; i < res.size() && i < m; ++i) {
45 printf("%s %d %d\n", res[i].name, res[i].age, res[i].netWorth);
46 }
47 if (res.empty()) printf("None\n");
48 }
49
50 return 0;
51 }
标签：24,1055,people,int,age,Richest,netWorth,World,5888 来源： https://www.cnblogs.com/ruruozhenhao/p/12844516.html
本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享； 2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关； 3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关； 4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除； 5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。