zoukankan      html  css  js  c++  java
  • A1055. The World's Richest

    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

     1 #include<cstdio>
     2 #include<iostream>
     3 #include<algorithm>
     4 #include<string.h>
     5 using namespace std;
     6 typedef struct{
     7     char name[9];
     8     int age;
     9     int worth;
    10 }info;
    11 bool cmp(info a, info b){
    12     if(a.worth != b.worth)
    13         return a.worth > b.worth;
    14     else if(a.age != b.age)
    15         return a.age < b.age;
    16     else return strcmp(a.name, b.name) < 0;
    17 }
    18 
    19 info people[100001];
    20 int main(){
    21     int N, K;
    22     scanf("%d%d", &N, &K);
    23     for(int i = 0; i < N; i++){
    24         scanf("%s %d %d", people[i].name, &people[i].age, &people[i].worth);
    25     }
    26     sort(people, people + N, cmp);
    27     for(int i = 0; i < K; i++){
    28         int M, min_, max_, cnt = 0;
    29         scanf("%d%d%d", &M, &min_, &max_);
    30         printf("Case #%d:
    ", i + 1);
    31         for(int j = 0; j < N; j++){
    32             if(people[j].age <= max_ && people[j].age >= min_){
    33                 printf("%s %d %d
    ", people[j].name, people[j].age, people[j].worth);
    34                 cnt++;
    35             }
    36             if(cnt == M){
    37                 break;
    38             }
    39         }
    40         if(cnt == 0)
    41             printf("None
    ");
    42     }
    43     cin >> K;
    44     return 0;
    45 }
    View Code
  • 相关阅读:
    建立表空间和用户
    数据库设计的基本步骤
    ubuntu21.04(linux):安装python3+dlib+face_recognition
    ubuntu21.04(linux):为chrome安装vue-devtools(6.0.0 beta 14)调试插件
    ubuntu21.04(linux):安装node(14.17.1)和vue.js3.1环境
    ubuntu21.04(linux):用apt安装nginx/php/mysql/phpmyadmin(开发环境)
    ubuntu21.04(linux):安装webstorm2021.1
    linux:在fedora 32/ubuntu 21.04安装chrome 90浏览器
    spring boot单元测试之十六:junit5:用@Timeout注解判断测试运行是否超时(spring boot 2.4.4)
    spring boot单元测试之十五:用mockmvc测试返回异步结果的controller(spring boot 2.4.4)
  • 原文地址:https://www.cnblogs.com/zhuqiwei-blog/p/8491779.html
Copyright © 2011-2022 走看看