PAT(A) - 1055. The World's Richest (25)
2016-09-24 18:21
381 查看
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
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:
Sample Output:
思路分析:一个排序问题,先按worth排序,再按age排序,最后考虑name排序。暴力一个一个遍历,没超时
#include <cstdio>
#include <algorithm>
#include <string.h>
#define MAX 100000
using namespace std;
typedef struct {
char name[10];
int age;
int worth;
} Person;
Person person[MAX];
int cmp( Person a, Person b ) {
if( a.worth != b.worth ) {
return a.worth > b.worth ? 1 : 0;
}
else if( a.age != b.age ) {
return a.age < b.age ? 1 : 0;
}
return strcmp( a.name, b.name ) < 0;
}
int main() {
//freopen( "123.txt", "r", stdin );
int n, m;
scanf( "%d%d", &n, &m );
for( int i = 0; i < n; i++ ) {
scanf( "%s %d %d", person[i].name, &person[i].age, &person[i].worth );
}
sort( person, person + n, cmp );
int k, min, max;
for( int i = 0; i < m; i++ ) {
scanf( "%d%d%d", &k, &min, &max );
printf( "Case #%d:\n", i + 1 );
int count = 0;
for( int j = 0; j < n; j++ ) {
if( count >= k ) break;
if( person[j].age >= min && person[j].age <= max ) {
printf( "%s %d %d\n", person[j].name, person[j].age, person[j].worth );
count++;
}
}
if( count == 0 ) {
printf( "None\n" );
}
}
return 0;
}
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
思路分析:一个排序问题,先按worth排序,再按age排序,最后考虑name排序。暴力一个一个遍历,没超时
#include <cstdio>
#include <algorithm>
#include <string.h>
#define MAX 100000
using namespace std;
typedef struct {
char name[10];
int age;
int worth;
} Person;
Person person[MAX];
int cmp( Person a, Person b ) {
if( a.worth != b.worth ) {
return a.worth > b.worth ? 1 : 0;
}
else if( a.age != b.age ) {
return a.age < b.age ? 1 : 0;
}
return strcmp( a.name, b.name ) < 0;
}
int main() {
//freopen( "123.txt", "r", stdin );
int n, m;
scanf( "%d%d", &n, &m );
for( int i = 0; i < n; i++ ) {
scanf( "%s %d %d", person[i].name, &person[i].age, &person[i].worth );
}
sort( person, person + n, cmp );
int k, min, max;
for( int i = 0; i < m; i++ ) {
scanf( "%d%d%d", &k, &min, &max );
printf( "Case #%d:\n", i + 1 );
int count = 0;
for( int j = 0; j < n; j++ ) {
if( count >= k ) break;
if( person[j].age >= min && person[j].age <= max ) {
printf( "%s %d %d\n", person[j].name, person[j].age, person[j].worth );
count++;
}
}
if( count == 0 ) {
printf( "None\n" );
}
}
return 0;
}
相关文章推荐
- phpstudy集成环境下,php 不是内部或外部命令...
- 向数据库中插入特殊符号测试
- 待读
- Effective java笔记(八),异常
- JS图片旋转
- Effective java笔记(七),通用程序设计
- Android 图片缩放自定义控件
- 从eclipse导入文件和真机运行
- sort与uniq
- Effective java笔记(六),方法
- JavaBean
- studio标题栏无标题
- Android基础笔记----Service
- andfix 多次修改同一个方法报错的解决
- Effective java笔记(五),枚举和注解
- Studio中添加assets目录
- shell基础四
- 微软必应词典客户端的案例分析
- Effective java笔记(四),泛型
- android ExpandableTextView可伸缩的TextView