1055. The World's Richest (25)

最新推荐文章于 2019-02-26 16:01:23 发布

原创最新推荐文章于 2019-02-26 16:01:23 发布 · 281 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

94 篇文章

订阅专栏

本文介绍了一个使用 C++ 实现的复杂排序算法案例。该算法针对一组人的姓名、年龄及财富进行排序，并支持按年龄范围查询最富有的前M个人。通过自定义结构体和比较运算符，实现了对人的信息进行灵活的比较与排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

struct people {
	string * name;
	int age;
	int wealth;
	
	bool operator<(const people & b) const {
		return 	(wealth != b.wealth) ? (wealth > b.wealth) :
					(age != b.age ? (age < b.age) : (*name < *b.name));
	}
};

#define A 201

int main(int argc, char **argv) {
	int n, query;
	scanf("%d%d", &n, &query);
	
	vector<people> pla[A];
	
	char name[10];
	int age, wealth;
	for(int i = 0; i < n; i ++) {
		scanf("%s%d%d", name, &age, &wealth);
		people p = { new string(name), age, wealth };
		pla[age].push_back(p);
	}
	
	for(int i = 0; i < A; i ++) {
		sort(pla[i].begin(), pla[i].end());
	}
	
	for(int i = 0; i < query; i ++) {
		int m, a1, a2;
		scanf("%d%d%d", &m, &a1, &a2);
		
		printf("Case #%d:\n", i+1);
		int order;
		int index[A] = {0};
		int minw = 0;
		for(order = 0; order < m; order ++) {
			people p = { 0, 0, 0x80000000 };
			int best = 0;
			for(int j = a1; j <= a2; j ++) {
				int xx = index[j];
				if(xx < pla[j].size() && pla[j][xx] < p) {
					p = pla[j][xx];
					best = j;
				}
			}
			if(best) {
				printf("%s %d %d\n", p.name->c_str(), p.age, p.wealth);
				index[best] ++;
				minw = p.wealth;
			}
			else
				break;
		}
		if(order == m) {/*
			while(true) {
				people p = { 0, 0, 0 };
				int best = 0;
				for(int j = a1; j <= a2; j ++) {
					int xx = index[j];
					if(xx < pla[j].size() && pla[j][xx].wealth == minw && pla[j][xx] < p) {
						p = pla[j][xx];
						best = j;
					}
				}
				if(best) {
					printf("%s %d %d\n", p.name->c_str(), p.age, p.wealth);
					index[best] ++;
				}
				else
					break;
			}*/
		}
		else if(!order) {
			printf("None\n");
		}
	}					
		
	return 0;
}