1055. The World's Richest (25)【排序】——PAT (Advanced Level) Practise
来源:互联网 发布:seo标题 编辑:程序博客网 时间:2024/05/01 09:19
题目信息
1055. The World’s Richest (25)
时间限制400 ms
内存限制128000 kB
代码长度限制16000 B
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 (<=10^5) - the total number of people, and K (<=10^3) - 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 [-10^6, 10^6]) 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
解题思路
排序,题目中提到M不大于100,所以每个年龄段超过100人时要截断,数据卡这个地方我也是醉了,,,
AC代码
#include <cstdio>#include <cstring>#include <vector>#include <algorithm>using namespace std;struct NODE{ char name[10]; int age, worth;}node[100005];vector<int> agelst[202];vector<int> lst;bool cmp(const int a, const int b){ if (node[a].worth == node[b].worth){ if (node[a].age == node[b].age){ return strcmp(node[a].name, node[b].name) < 0; } return node[a].age < node[b].age; } return node[a].worth > node[b].worth;}int main(){ int n, k, nth, minAge, maxAge; scanf("%d%d", &n, &k); for (int i = 0; i < n; ++i){ scanf("%s%d%d", node[i].name, &node[i].age, &node[i].worth); agelst[node[i].age].push_back(i); } for (int i = 0; i < 202; ++i){ if (agelst[i].size() > 0){ if (agelst[i].size() > 100){ partial_sort(agelst[i].begin(), agelst[i].begin() + 100, agelst[i].end(), cmp); lst.insert(lst.end(), agelst[i].begin(), agelst[i].begin() + 100); }else{ lst.insert(lst.end(), agelst[i].begin(), agelst[i].end()); } } } sort(lst.begin(), lst.end(), cmp); for (int i = 0; i < k; ++i){ scanf("%d%d%d", &nth, &minAge, &maxAge); int cnt = 0; printf("Case #%d:\n", i + 1); for (int j = 0; cnt < nth && j < n; ++j){ if (node[lst[j]].age >= minAge && node[lst[j]].age <= maxAge){ printf("%s %d %d\n", node[lst[j]].name, node[lst[j]].age, node[lst[j]].worth); ++cnt; } } if (cnt == 0){ printf("None\n"); } } return 0;}
- 1055. The World's Richest (25)【排序】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1055 The World's Richest (25)
- PAT (Advanced Level) Practise 1055 The World's Richest (25)
- 【C++】PAT(advanced level)1055. The World's Richest (25)*
- 【PAT】【Advanced Level】1055. The World's Richest (25)
- PAT (Advanced Level) 1055. The World's Richest (25) 年龄区间内最有钱的人,结构体排序
- Pat(Advanced Level)Practice--1055(The World's Richest)
- PAT (Advanced) 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)
- 1029. Median (25)【排序】——PAT (Advanced Level) Practise
- PAT 数据结构 08-排序4. The World's Richest (25)
- vs2013中如何打开asp.net配置页面
- Ebay架构特点(HPTS 2009)
- android 5.0新特性,recyclerview的基本用法,及应注意的问题
- Android调用JNI的进阶实例(摄像头预览数据转码RGB播放)
- 大型网站技术架构Tips
- 1055. The World's Richest (25)【排序】——PAT (Advanced Level) Practise
- struts2+jquery.ajax+json实现用户登陆,报错org.apache.struts2.json.JSONException:解决办法
- 利用jquery函数submit()提交表单注意事项
- Html判断客户端使用的Android还是Ios
- Java多线程简单介绍-1
- 010 MATLAB奇淫技巧之实现图片扫描
- 实验三的迷宫问题
- Remove Duplicates from Sorted List
- adb 命令行