PAT甲级 1055. The World's Richest (25)
来源:互联网 发布:在a标签传随机参数js 编辑:程序博客网 时间:2024/06/05 10:20
题目:
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 4Zoe_Bill 35 2333Bob_Volk 24 5888Anny_Cin 95 999999Williams 30 -22Cindy 76 76000Alice 18 88888Joe_Mike 32 3222Michael 5 300000Rosemary 40 5888Dobby 24 5888Billy 24 5888Nobody 5 04 15 454 30 354 5 951 45 50Sample Output:
Case #1:Alice 18 88888Billy 24 5888Bob_Volk 24 5888Dobby 24 5888Case #2:Joe_Mike 32 3222Zoe_Bill 35 2333Williams 30 -22Case #3:Anny_Cin 95 999999Michael 5 300000Alice 18 88888Cindy 76 76000Case #4:None思路:
一开始,我先把名单按照年龄排序,之后根据年龄范围,取出子序列,再根据财富、年龄、姓名进行排序,但是有一个测试点超时。
其实可以先根据财富、年龄、姓名进行排序,再根据年龄范围和名单个数输出。注意用scanf和printf。
代码:
#include<iostream>#include<vector>#include<algorithm>#include<string>using namespace std;//先按照先财富再年龄再名字进行排序,再根据年龄范围输出struct member{ char name[9];int age;int worth;};vector<member> billionaries(100000);struct range{int num;int lower;int upper;};bool cmp2(member &n1, member &n2){if (n1.worth != n2.worth){return n1.worth > n2.worth;}else{if (n1.age != n2.age){return n1.age < n2.age;}else{int i;for (i = 0; i < 9; ++i){if (n1.name[i] != n2.name[i])return n1.name[i] < n2.name[i];}}}}int main(){ifstream cin;cin.open("case1.txt");//inputint N, K;cin >> N >> K;billionaries.resize(N);int i = 0;for (; i < N; ++i){//scanf("%s%d%d", billionaries[i].name, &billionaries[i].age,&billionaries[i].worth);cin >> billionaries[i].name >> billionaries[i].age >> billionaries[i].worth;}vector<range> R(K);for (i = 0; i < K; ++i){//scanf("%d%d%d",&R[i].num,&R[i].lower,&R[i].upper);cin >> R[i].num >> R[i].lower >>R[i].upper ;}sort(billionaries.begin(),billionaries.end(),cmp2);for (i = 0; i < K; ++i){printf("Case #%d:\n",(i+1));//cout << "Case #" << i + 1 << ":" << endl;int num = 0;for (int j = 0; j < N; ++j){if (billionaries[j].age >= R[i].lower && billionaries[j].age <= R[i].upper){printf("%s %d %d\n", billionaries[j].name, billionaries[j].age, billionaries[j].worth);//cout << sub_b[j].name << " " << sub_b[j].age << " " << sub_b[j].worth << endl;++num;if (num >= R[i].num)break;}}if (num == 0)cout << "None" << endl;}system("pause");return 0;}
- 1055. The World's Richest (25)-PAT甲级真题
- 【PAT甲级】1055. The World's Richest (25)
- PAT(甲级)1055. The World's Richest (25)
- 1055. The World's Richest (25) PAT甲级
- PAT甲级练习1055. The World's Richest (25)
- PAT甲级1055. The World's Richest (25)
- PAT 甲级 1055. The World's Richest (25)
- PAT甲级 1055. The World's Richest (25)
- 【PAT】1055. The World's Richest (25)
- pat 1055. The World's Richest (25)
- pat 1055. The World's Richest (25)
- PAT: 1055. The World's Richest (25)
- PAT 1055. The World's Richest (25)
- pat 1055. The World's Richest (25)
- PAT 1055. The World's Richest (25)
- PAT 1055. The World's Richest (25)
- <PAT>1055. The World's Richest
- PAT 1055. The World's Richest
- 读Linux内核源码情景分析(一)
- HaoSQL_好用的SQL等数据库一键包发布!
- Python命令行注册pypi出现410报错无法登陆的问题解决
- 使用 spring.profiles.active 及 @profile 注解 动态化配置内部及外部配置
- hbase存储大数据量相关配置调优
- PAT甲级 1055. The World's Richest (25)
- Greendao 简单实现增删改查使用过GreenDao的同学都知道,3.0之前需要通过新建GreenDaoGenerator工程生成Java数据对象(实体)和DAO对象,非常的繁琐而且也加大了使用成
- java桃心形状
- 5.1 Hadoop数据序列化
- VMWare VMNet 8 的配置使用
- Android 源码系列之<十七>自定义Gradle Plugin,优雅的解决第三方Jar包中的bug<上>
- 多元线性回归
- IntelliJ IDEA For Mac 快捷键
- Hololens开发时注意的地方