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_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
思路:因为只有200个年龄,输入的行数最长有100000,平均每个年龄有500.加上M最大只有100,所以有些数据需要剔除。
注释部分是超时的代码(test 2不能通过),主要原因是每输入一个M min max,就要把一些vector排序,有重复。
/*
#include <iostream>
#include"stdio.h"
#include"stdlib.h"
#include"string.h"
#include"algorithm"
#include"vector"
using namespace std; struct person{
char name[9];
int age;
long worth;
}; bool comparePersonByWorth(struct person p1, struct person p2){
if(p1.worth>p2.worth){
return true;
}
return false;
} bool compare(struct person p1,struct person p2){
if(p1.worth>p2.worth)
return true;
if(p1.worth==p2.worth){
if(p1.age<p2.age)
return true;
if(p1.age==p2.age){
if(strcmp(p1.name,p2.name)<0){
return true;
}
}
}
return false;
}
int main()
{
vector<struct person> v[201];
long N;
int K; int M,minn,maxn; scanf("%ld%d",&N,&K); struct person p; for(long i=0;i<N;i++){
scanf("%s%d%ld",p.name,&p.age,&p.worth);
v[p.age].push_back(p);
} for(long i=1;i<=200;i++){
if(v[i].size()>100)
sort(v[i].begin(),v[i].begin(),comparePersonByWorth);
} int v_size,length,s;
for(int i=1;i<=K;i++){ scanf("%d%d%d",&M,&minn,&maxn); vector<struct person> v2 = v[minn]; for(int j=minn+1;j<=maxn;j++){
v_size = v[j].size();
length = (100>v_size)?v_size:100; v2.insert(v2.end(),v[j].begin(),v[j].begin()+length);
} printf("Case #%d:\n",i);
if(!v2.empty()){
sort(v2.begin(),v2.end(),compare);
v_size = v2.size();
s = (M>v_size)?v_size:M;
for(int k=0;k<s;k++){
printf("%s %d %ld\n",v2[k].name,v2[k].age,v2[k].worth);
}
}
else
{
printf("None\n");
}
}
return 0;
}
*/
#include <iostream>
#include"stdio.h"
#include"stdlib.h"
#include"string.h"
#include"algorithm"
#include"vector"
using namespace std; struct person{
char name[9];
int age;
long worth;
}; bool comparePersonByWorth(struct person p1, struct person p2){
if(p1.worth>p2.worth){
return true;
}
return false;
} bool compare(struct person p1,struct person p2){
if(p1.worth>p2.worth)
return true;
if(p1.worth==p2.worth){
if(p1.age<p2.age)
return true;
if(p1.age==p2.age){
if(strcmp(p1.name,p2.name)<0){
return true;
}
}
}
return false;
}
int main()
{
vector<struct person> v[201];
long N;
int K; int M,minn,maxn; scanf("%ld%d",&N,&K); struct person p; for(long i=0;i<N;i++){
scanf("%s%d%ld",p.name,&p.age,&p.worth);
v[p.age].push_back(p);
} vector<struct person> v2; int v_size,length,s;
for(long i=1;i<=200;i++){
/*如果相同年龄的富豪超过100个,则按照财富值筛选出前100*/
if(v[i].size()>100){
sort(v[i].begin(),v[i].end(),comparePersonByWorth); }
v_size = v[i].size();
length = (100>v_size)?v_size:100;
v2.insert(v2.end(),v[i].begin(),v[i].begin()+length);
}
sort(v2.begin(),v2.end(),compare); for(int i=1;i<=K;i++){
scanf("%d%d%d",&M,&minn,&maxn);
bool flag = false;
printf("Case #%d:\n",i);
int cnt = 0;//记录已经输出的富豪数目
for(int k=0;cnt<M&&k<v2.size();k++){
if(v2[k].age>=minn&&v2[k].age<=maxn){
printf("%s %d %ld\n",v2[k].name,v2[k].age,v2[k].worth);
flag = true;
cnt++;
}
} if(flag==false)
{
printf("None\n");
}
}
return 0;
}
1055. The World's Richest (25)的更多相关文章
- PAT 甲级 1055 The World's Richest (25 分)(简单题,要用printf和scanf,否则超时,string 的输入输出要注意)
1055 The World's Richest (25 分) Forbes magazine publishes every year its list of billionaires base ...
- PAT (Advanced Level) Practice 1055 The World's Richest (25 分) (结构体排序)
Forbes magazine publishes every year its list of billionaires based on the annual ranking of the wor ...
- 1055 The World's Richest (25分)(水排序)
Forbes magazine publishes every year its list of billionaires based on the annual ranking of the wor ...
- PAT (Advanced Level) 1055. The World's Richest (25)
排序.随便加点优化就能过. #include<iostream> #include<cstring> #include<cmath> #include<alg ...
- PAT甲题题解-1055. The World's Richest (25)-终于遇见一个排序的不水题
题目简单,但解题的思路需要转换一下,按常规思路肯定超时,推荐~ 题意:给出n个人的姓名.年龄和拥有的钱,然后进行k次查询,输出年龄在[amin,amx]内的前m个最富有的人的信息.如果财富值相同就就先 ...
- 【PAT甲级】1055 The World's Richest (25 分)
题意: 输入两个正整数N和K(N<=1e5,K<=1000),接着输入N行,每行包括一位老板的名字,年龄和财富.K次询问,每次输入三个正整数M,L,R(M<=100,L,R<= ...
- pat1055. The World's Richest (25)
1055. The World's Richest (25) 时间限制 400 ms 内存限制 128000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue ...
- PATA1055 The World's Richest (25 分)
1055 The World's Richest (25 分) Forbes magazine publishes every year its list of billionaires based ...
- PAT 1055 The World's Richest[排序][如何不超时]
1055 The World's Richest(25 分) Forbes magazine publishes every year its list of billionaires based o ...
随机推荐
- ASP.NET 5探险(3):使用UMEditor并实现图片上传
(此文章同时发表在本人微信公众号"dotNET每日精华文章",欢迎右边二维码来关注.) 题记:今天将继续上一篇来讲解百度富文本Web编辑器UEditor或UMEditor的使用. ...
- AIX下禁止crs随ha启动而启动
/etc/init.crs enable /etc/init.crs disable 查看目前crs是enable还是disable状态 状态记录在一个文本文件里 /etc/oracle/scls_ ...
- vector的主要操作
vector常用方法 assign() 对Vector中的元素赋值 void assign( input_iterator start, input_iterator end ); // void a ...
- gdb调试小结
gdb最基本的调试命令. 1以调试程序test.cpp为例: 进入调试环境 gdb test 2.b 12 在文件的第12行设置断点. 删除断点: info b 列出所有的断点信息 (gdb) inf ...
- loj 1337
题目链接:http://lightoj.com/volume_showproblem.php?problem=1337 思路:对于搜过的区域进行标记,如果要求的点落在已经搜过的区域,那么直接取出来即可 ...
- Linux学习笔记(1)Linux虚拟机安装过程中的知识点及常用管理工具
1. VMware的相关知识 (1)建议的VMware的配置: CPU 主频1GHz以上 内存 1GB以上 硬盘 分区空闲空间8GB以上 (2)VMware创建快照 快照的作用是保存虚拟机的现有状态, ...
- windows主机开启openssl的方法
转自:http://www.feichang56.com/openssl/
- Android 通过Java代码生成创建界面。动态生成View,动态设置View属性。addRules详解
废话不多说,本文将会层层深入给大家讲解如何动态的生成一个完整的界面. 本文内容: Java代码中动态生成View Java代码中动态设置View的位置,以及其他的属性 LayoutParams详解 一 ...
- JQuery学习之操作DOM
1.DOM,就是Document Object Model(文档对象模型) 2.获得内容的方法: **text():设置或返回所选元素的文本内容 $("#btn1").click( ...
- react-基础(2)
表单相关 固定的几个属性和事件 value: <input>,<textarea>; checked: <input> typeof checkbox, radio ...