PAT(Advanced) 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 range of ages. That is, given the net worths of N people, you must find the Mrichest 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 (≤10​5​​) - the total number of people, and K (≤10​3​​) - 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​6​​,10​6​​]) 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.

解答：这种题目在PAT甲级中真的超级多，题目难度不大，但常常时间或者内存受限，所以经常要用空间换时间，或者用时间换空间。我第一次做的时候，对每个年龄的人分类存储，然后每次查询时，针对对应年龄段的人进行排序，然后有一个用例超时。后来看了看了另一位博主的代码，茅塞顿开，题目中M <= 100，因此每个年龄只需要前100名就行了，这样对于大量数据能够做到有效的删减。终于AC！

AC代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>

using namespace std;

typedef struct{
	int age, worth;
	char name[10];
}richer;

bool cmp(richer r1, richer r2)
{
	if(r1.worth != r2.worth){
		return r1.worth > r2.worth;
	}else if(r1.age != r2.age){
		return r1.age < r2.age;
	}else{
		return (strcmp(r1.name, r2.name) < 0);
	}
}
int main()
{
	int N, K;
	vector<richer> richers;
	int cal[205];
	
	memset(cal, 0, sizeof(cal));
	scanf("%d %d", &N, &K);
	
	vector<richer> total(N); 
	for(int i = 0; i < N; ++i)
	{
		scanf("%s %d %d", total[i].name, &total[i].age, &total[i].worth);
	}
	sort(total.begin(), total.end(), cmp);
	
	for(int i = 0; i < total.size(); ++i)
	{
		if(cal[total[i].age]++ < 100)
		{
			richers.push_back(total[i]);
		}
	}
	//输出 
	for(int i = 1; i <= K; ++i){
		int M, amin, amax;
		vector<richer> tmp;
		
		printf("Case #%d:\n", i);
		scanf("%d %d %d", &M, &amin, &amax);
		int count = 0;
		for(int k = 0; k < richers.size(); ++k)
		{
			if( amin <= richers[k].age && richers[k].age <= amax)
			{
				tmp.push_back(richers[k]);
				if(++count == M) break; 
			}
		}
		if(tmp.size())
		{
			sort(tmp.begin(), tmp.end(), cmp);
			for(int j = 0; j < tmp.size() && j < M; ++j)
			{
				printf("%s %d %d\n", tmp[j].name, tmp[j].age, tmp[j].worth);
			}
		}
		else
		{
			printf("None\n");
		}
	}
	return 0;
}