Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

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

解答

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int mx = 100000+10;
struct Node {char name[10]; int age, w; } node[mx];
int a[mx], age[mx], mem[mx], id;

bool cmp(const int &x, const int &y)
{
	if (node[x].w != node[y].w)
		return node[x].w > node[y].w;
	else if (node[x].age != node[y].age)
		return node[x].age < node[y].age;
	else
		return strcmp(node[x].name, node[y].name) < 0;
}

int main()
{
	int n, m; scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++)
		a[i] = i, scanf("%s%d%d", &node[i].name, &node[i].age, &node[i].w);
	sort(a, a + n, cmp);

	for (int i = 0; i < n; i++) //每个年龄段只取前100个人,因为每个查询最多需要100个
		if (++age[node[a[i]].age] <= 100)
			mem[id++] = a[i];

	for (int i = 1; i <= m; i++)
	{
		printf("Case #%d:\n", i);
		int num, mn, mx; scanf("%d%d%d", &num, &mn, &mx);

		int exist = 0;
		for (int j = 0; j < id && exist < num; j++)
			if (node[mem[j]].age >= mn && node[mem[j]].age <= mx)
			{
				exist++;
				printf("%s %d %d\n", node[mem[j]].name, node[mem[j]].age, node[mem[j]].w);
			}

		if (!exist) printf("None\n");
	}
	return 0;
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论