PAT1055. 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
思路：超级水题 只需要记住 10^5是有5个零。  之前写成四个零。所以导致段错误

 1 #include <iostream>
 2 #include <algorithm>
 3 #include <cstring>
 4 #include <cstdio>
 5 using namespace std;
 6 #define MAX 100010
 7 struct Record
 8 {
 9     char name[12];
10     int age;
11     int networth;
12 }Record[MAX];
13 bool cmp(struct Record A,struct Record B)
14 {
15     if(A.networth!=B.networth)
16        return A.networth>B.networth;
17     else if(A.age!=B.age)
18        return A.age<B.age;
19     else
20     {
21         int s=strcmp(A.name,B.name);
22         return s<0;
23     }
24 }
25 int main(int argc, char *argv[])
26 {
27     int count,query;
28     scanf("%d%d",&count,&query);
29     for(int i=0;i<count;i++)
30     {
31         scanf("%s%d%d",Record[i].name,&Record[i].age,&Record[i].networth);
32     }
33     sort(Record,Record+count,cmp);
34     for(int i=0;i<query;i++)
35     {
36         int M,Amin,Amax;
37         scanf("%d%d%d",&M,&Amin,&Amax);
38         printf("Case #%d:\n",i+1);
39         int cnt=0;
40         for(int j=0;j<count;j++)
41         {
42             if(Record[j].age>=Amin&&Record[j].age<=Amax)
43             {
44                 cnt++;
45                 printf("%s %d %d\n",Record[j].name,Record[j].age,Record[j].networth);
46                 if(cnt==M)
47                    break;
48             }
49         }
50         if(cnt==0)
51           printf("None\n");
52     }
53     return 0;
54 }

PAT1055. The World's Richest

时间： 2024-10-06 09:44:43

PAT1055. The World's Richest的相关文章

PAT-1055. The World&#39;s Richest (25)

这道题目就是一个排序题目,但是如果简单的排序会超时,需要剪掉一部分数据. 最多输出100名数据,排序后,那么相同年龄的后面的数据就不会输出了,所以也不需记录在查找序列里面.因此这部分数据可以忽略掉. bool cmp  return true means right position. make_heap(iterato_begin,iterator_end); heap_sort(iterator_begin,iterator_end); 堆排序. // 1055.cpp : 定义控制台应用程

pat1055. The World&#39;s Richest (25)

1055. The World's Richest (25) 时间限制 400 ms 内存限制 128000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue 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 si

PAT：1055. The World&#39;s Richest (25) AC

#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; struct Person { char name[10]; int age,money; }P[100010]; bool cmp(Person a,Person b) { if(a.money!=b.money) return a.money>b.money; else if(a.age!=b.age) r

PAT The World&#39;s Richest

The World's Richest 直白的排序题   难得的一次AC 1 #include <stdio.h> 2 #include <stdlib.h> 3 #include <string.h> 4 typedef struct 5 { 6 char name[10] ; 7 int age; 8 int worth; 9 } people; 10 people p[100000]; 11 int N,K; 12 int M,amin,amax,flag; 13

PAT (Advanced Level) 1055. The World&#39;s Richest (25)

排序.随便加点优化就能过. #include<iostream> #include<cstring> #include<cmath> #include<algorithm> #include<cstdio> #include<map> #include<queue> #include<string> #include<stack> #include<vector> using names

PAT 1055 The World&#39;s Richest

#include <cstdio> #include <cstdlib> #include <cstring> #include <vector> #include <queue> #include <algorithm> using namespace std; #define AGE_MAX 200 class People { public: char name[9]; int worth; int age; int idx;

1055. The World&#39;s Richest (25)

1 #include <stdio.h> 2 #include <vector> 3 #include<string.h> 4 #include<algorithm> 5 using namespace std; 6 7 struct MyStruct 8 { 9 char name[9]; 10 int age,worth; 11 }; 12 13 int cmp(MyStruct a,MyStruct b) 14 { 15 if(a.worth!=b.w

1055. The World&#39;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 n

1055 The World&#39;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 ran