PAT 1055 The World's Richest

一、题目大意

1. PAT 1055

二、解题思路

1. 就是排序啦。

三、参考代码

#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>

using namespace std;

struct per {
	string name;
	int age, worth;
	per(string name, int age, int worth) :name(name), age(age), worth(worth) {}
};

vector <per> v;
vector <per> ans;
int valid[205] = { 0 };

bool cmp(per p1, per p2) {
	if (p1.worth != p2.worth)
		return p1.worth > p2.worth;
	else if (p1.age != p2.age)
		return p1.age < p2.age;
	else return p1.name < p2.name;
}

int main() {
	int n, k;
	scanf("%d %d", &n, &k);
	string name;
	int age, worth;
	name.resize(10);
	for (int i = 0; i < n; i++) {
		scanf("%s %d %d", &name[0], &age, &worth);
		v.push_back(per(name, age, worth));
	}
	sort(v.begin(), v.end(), cmp);
	for (int i = 0; i < n; i++) {
		if (valid[v[i].age] > 100) continue;
		else {
			valid[v[i].age]++; 
			ans.push_back(v[i]);
		}
	}
	int m, amin, amax;
	for (int i = 1; i <= k; i++) {
		scanf("%d %d %d", &m, &amin, &amax);
		int cnt = 0;
		printf("Case #%d:\n", i);
		for (int j = 0; j < n; j++) {
			if (amin <= ans[j].age && ans[j].age <= amax) {
				printf("%s %d %d\n", &ans[j].name[0], ans[j].age, ans[j].worth);
				cnt++;
			}
			if (cnt == m)
				break;
		}
		if (cnt == 0)
			printf("None\n");
	}
	return 0;
}

四、解题感悟

1. 本题比较坑的地方就是当数据量达到极限时会超时，测试点 2 过不去。注意到 M 不超过100，此时采用空间换时间的办法，进行预处理，将每个年龄段的100名以内的富翁另外存成一个数组，后续只需在这个数组中进行查找即可。