1055 The World's Richest （25 point(s)）

题解

很容易超时，各种优化，最后还出现段错误。心态爆炸的一道题。

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
const int MAXN = 100;
struct node {
	char name[9];
	int age, money;
	bool operator < (const node& rhs) const {
		return money != rhs.money ? money > rhs.money : (age != rhs.age ? age < rhs.age : strcmp(name, rhs.name) < 0);
	}
};
int n, k;
int amin, amax, num;
int book[MAXN * 2 + 10];
int main() {
	scanf("%d%d", &n, &k);
	vector<node> v(n), res;
	for(int i = 0; i < n; ++i) scanf("%s %d %d", v[i].name, &v[i].age, &v[i].money);
	sort(v.begin(), v.end());
	for(int i = 0; i < n; ++i) if(book[v[i].age] < MAXN) {
		book[v[i].age]++;
		res.push_back(v[i]);
	}
	for(int i = 1; i <= k; ++i) {
		printf("Case #%d:\n", i);
		vector<node> t;
		scanf("%d%d%d", &num, &amin, &amax);
		for(int j = 0; j < res.size(); ++j) if(res[j].age >= amin && res[j].age <= amax) t.push_back(res[j]);
		if(t.size() == 0) printf("None\n");
		else {
			for(int l = 0; l < t.size() && l < num; ++l) printf("%s %d %d\n", t[l].name, t[l].age, t[l].money);
		}
	}
	return 0;
}