10-排序4. The World's Richest (25)
来源:互联网 发布:衣柜要做到顶吗 知乎 编辑:程序博客网 时间:2024/06/13 23:55
10-排序4. 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_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
先读明白题意,在给定的年龄区间内找出M个排序靠前的富人;所以得先按照题意的排序要求对富人进行排序。
#include<iostream>#include<algorithm>#include<vector>#include<string>using namespace std;struct Richest{string Name;int Age;int Net_Worth;};bool Comp(const Richest &a,const Richest &b) //排序关系:资本递减 > 年龄递增 > 名字递增 {if(a.Net_Worth != b.Net_Worth)return a.Net_Worth > b.Net_Worth;else{if(a.Age != b.Age)return a.Age < b.Age;elsereturn a.Name < b.Name;}}int main(){int i,N,K;vector<Richest> s;vector<Richest>::iterator it;Richest r;cin>>N>>K;for(i=0;i<N;i++){cin>>r.Name>>r.Age>>r.Net_Worth;s.push_back(r);}sort(s.begin(),s.end(),Comp);//排序 int M,Amin,Amax,count;for(i=0;i<K;i++){cin>>M>>Amin>>Amax;count=0;cout<<"Case #"<<i+1<<":"<<endl;for(it=s.begin();count<M && it!=s.end();it++){if((*it).Age>=Amin && (*it).Age<=Amax){//取相应年龄区间的前 M 个 count++;cout<<(*it).Name<<" "<<(*it).Age<<" "<<(*it).Net_Worth<<endl;}}if(!count)cout<<"None"<<endl;}return 0;}
- 10-排序4. The World's Richest (25)
- 08-排序4. The World's Richest (25)
- PAT 数据结构 08-排序4. The World's Richest (25)
- PAT-A1055. The World's Richest (25)(排序)
- 1055. The World's Richest (25)-排序(易)
- PAT1055.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)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- PAT: 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- 1055. The World's Richest (25)
- H264和X264究竟有什么区别?
- Windows下安装eclipse C++版
- javascript中 $ 的作用
- 解题报告 之 SOJ1942 Foto
- 数据结构C语言实现线性表(顺序实现)的初始化与基本操作
- 10-排序4. The World's Richest (25)
- solrcloud--core.properties
- gdb调试&C语言指针高级编程(5.7)
- 电信141p123第32题
- [leetcode]Remove Nth Node From End of List
- iOS多线程为什么会出现不安全的情况
- P123.36T 切换时间显示
- spring security ajax 跳转登录页
- shell编程