PTA甲级考试真题练习137——1137 Final Grading

题目

思路

排序题，存入unordered_map再传入vector排序后输出

代码

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
struct Info {
	int gp, gm, gf,g;
};
unordered_map<string,Info> Map;
bool cmp(const pair<string, Info>& a, const pair<string, Info>& b) {
	return a.second.g != b.second.g ? a.second.g > b.second.g : a.first < b.first;
}
int main()
{
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 0; i < n; ++i) {
		string name;
		int gp;
		cin >> name >> gp;
		if(gp>=200)
			Map.emplace(pair<string, Info>(name, Info{ gp,-1,-1,-1 }));
	}
	for (int i = 0; i < m; ++i) {
		string name;
		int gm;
		cin >> name >> gm;
		auto p = Map.find(name);
		if (p != Map.end()) {
			p->second.gm = gm;
		}
	}
	for (int i = 0; i < k; ++i) {
		string name;
		int gf;
		cin >> name >> gf;
		auto p = Map.find(name);
		if (p != Map.end()) {
			p->second.gf = gf;
		}
	}
	auto p = Map.begin();
	while(p!=Map.end()){
		if (p->second.gm > p->second.gf) {
			p->second.g = round(p->second.gm * 0.4 + p->second.gf * 0.6);
		}
		else
			p->second.g = p->second.gf;
		if (p->second.g < 60) {
			auto k = p++;
			Map.erase(k);
		}
		else
			p++;
	}
	vector<pair<string, Info>> vec(Map.begin(),Map.end());
	sort(vec.begin(), vec.end(), cmp);
	for (auto& p : vec) {
		cout << p.first << " " << p.second.gp << " " << p.second.gm << " " << p.second.gf << " " <<p.second.g << endl;
	}
	return 0;
}