zoukankan      html  css  js  c++  java
  • 1055 The World's Richest (25 分)

    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 (≤) - 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 [AminAmax] 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 [AminAmax]. 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


    排个序然后暴力跑就木的问题。

     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 struct Node
     5 {
     6     string name;
     7     int age;
     8     int money;
     9 
    10     friend bool operator < (const Node &a, const Node &b){
    11         if(a.money == b.money){
    12             if(a.age == b.age){
    13                 return a.name+b.name < b.name+a.name;
    14             }
    15             return a.age < b.age;
    16         }
    17         return a.money > b.money;
    18     }
    19 }node[100006];
    20 int n,m;
    21 
    22 int main(){
    23     ios::sync_with_stdio(false);
    24     cin.tie(0);
    25     cout.tie(0);
    26     cin >> n >> m;
    27     int x, y, z;
    28     for(int i = 0 ; i < n; i++){
    29         cin >> node[i].name >> node[i].age >> node[i].money;
    30     }
    31     sort(node, node+n);
    32     // for(int i = 0 ; i < n; i++){
    33     //     cout << node[i].name << " "<< node[i].age <<" "<< node[i].money<<endl;
    34     // }
    35     for(int i = 0 ; i < m; i++){
    36         cin >> x >> y >> z;
    37         bool flag = true;
    38         cout <<"Case #"<< i+1<<":"<<endl;
    39         for(int j=0; j < n; j++){
    40             if(node[j].age>= y && node[j].age <= z && x){
    41                 x--;
    42                 flag = false;
    43                 cout << node[j].name << " "<< node[j].age <<" "<< node[j].money<<endl;
    44             }
    45         }
    46         if(flag){
    47             cout <<"None"<<endl;
    48         }
    49     }
    50 
    51 
    52 
    53     return 0;
    54 }


  • 相关阅读:
    熬夜不易,请老范喝杯烈酒
    php开发面试题---PHP为什么不安全,主要有那些安全问题(整理)
    PHP如何进行错误与异常处理(PHP7中的异常处理和之前版本异常处理的区别)
    PHP如何安装redis扩展(Windows下)
    网页实时聊天之PHP如何实现websocket
    C++ primer札记10-继承
    【Android】android图片轮播
    Android开发经验—不要指望类finalize干活的方法做你想要什么
    可以部署在广域网执行QQ高仿版 GG2014 (源代码)
    SNMP WINDOWS系统的命令行工具下载
  • 原文地址:https://www.cnblogs.com/zllwxm123/p/11173840.html
Copyright © 2011-2022 走看看