PAT-A1055-The World‘s Richest

PAT 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.

输入描述

 Each input file contains one test case. For each case, the first line contains 2 positive integers: N (≤10 e5) - the total number of people, and K (≤10 e3 ) - 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 e6 ,10 e6 ]) 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.

输出描述

 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.

---

示例：

输入

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

输出

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.首先是创建结构数组存取读入的数据
 2.根据题目输入的排序方式写出sort的cmp函数
 3.由于第二个测试点数据量比较大会容易超时，这里进行优化，因为最多输出的是100个（m值），因此可以将某个年龄，排序后在100名意外的剔除掉，使用age数组记录每个年龄的人数，同时将有效的数据存放到Valid有效数据结构数组中
 4.之后每次查询遍历处理后的结构数据就可以了，输出数量不会超过m当然也不能超过总的有效的数据数。

参考代码

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

const int maxn = 100005;

int age[maxn] = {0};//存放各个年龄的对应的人数

struct Student {
    char name[20];
    int age;
    int worth_value;
} Stu[maxn], Valid[maxn];//后者是处理过的有效结构数组

bool cmp(struct Student a, struct Student b) {
    if (a.worth_value != b.worth_value) {
        return a.worth_value > b.worth_value; //财富值从大到小排序
    } else if (a.age != b.age) {
        return a.age < b.age;// 年龄从小到大排序
    } else {
        return strcmp(a.name, b.name) < 0; //姓名按照字典序从小到大
    }

}

int main() {
    int n, k;
    scanf("%d %d", &n, &k);
    for (int i = 0; i < n; ++i) {
        scanf("%s %d %d", Stu[i].name, &Stu[i].age, &Stu[i].worth_value);
    }
    int validnum = 0;
    sort(Stu, Stu + n, cmp);
    for (int i = 0; i < n; ++i) {
        if (age[Stu[i].age] < 100) { //处理掉100名以外的数据
            age[Stu[i].age] += 1;
            Valid[validnum++] = Stu[i]; //添加到有效结构数组中去
        }
    }
    int pepnum, ageL, ageR;
    for (int i = 0; i < k; ++i) {
        scanf("%d %d %d", &pepnum, &ageL, &ageR);
        printf("Case #%d:\n", i + 1);
        int PrintNum = 0;
        int case1 = 0;
        for (int j = 0; j < validnum && PrintNum < pepnum; ++j) { //注意判断条件
            if (Valid[j].age >= ageL && Valid[j].age <= ageR) {
                printf("%s %d %d\n", Valid[j].name, Valid[j].age, Valid[j].worth_value);
                PrintNum++;
            }
        }
        if (PrintNum == 0) { //不存在符合条件的数据时
            printf("None\n");
        }
    }

    return 0;
}