C语言程序设计-1080 MOOC期终成绩

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
struct node{
	string name;
	int gp, gmid, gfin, gg;
};
bool cmp(const node &a, const node &b){
	return a.gg != b.gg? a.gg > b.gg : a.name < b.name;
}
int main(){
	int P, M, N, score;
	string id;
	cin >> P >> M >> N;
	map<string, int> m1; map<string, int> m2; map<string, int> m3;
	for(int i = 0; i < P; i++){
		cin >> id >> score; m1[id] = score;
	}
	for(int i = 0; i < M; i++){
		cin >> id >> score; m2[id] = score;		
	}
	for(int i = 0; i < N; i++){
		cin >> id >> score; m3[id] = score;		
	}
	vector<node> v;
	for(auto it : m1){
		int gg = 0;
		if(it.second >= 200){
			if(m2[it.first] > m3[it.first])
				gg = round( m2[it.first] * 0.4 + m3[it.first] * 0.6);
			else gg = m3[it.first];
			if(m2[it.first] == 0) m2[it.first] = -1;
		}
		if(gg >=60)
			v.push_back({it.first, it.second, m2[it.first], m3[it.first], gg});
	}
	sort(v.begin(), v.end(), cmp);
	for(int i = 0; i < v.size(); i++)
		printf("%s %d %d %d %d\n", v[i].name.c_str(), v[i].gp, v[i].gmid, v[i].gfin, v[i].gg);
	return 0;
}

最后一个测试点没过，推测是因为内存溢出，看了下这个代码需要6000多，而网上通过的用了3000多。参考了柳诺的代码，思路差不多，我用了3个map存数据相互比对完后再装入vector，她用了一个map存序号，将数据直接存入vector，因此减少使用了空间。

https://blog.csdn.net/liuchuo/article/details/79064649

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
struct node{
	string name;
	int gp, gmid, gfin, gg;
};
bool cmp(const node &a, const node &b){
	return a.gg != b.gg? a.gg > b.gg : a.name < b.name;
}
int main(){
	int P, M, N, score, gg, cnt=1;
	string id;
	cin >> P >> M >> N;
	map<string, int> ma;
	vector<node> v, ans;
	for(int i = 0; i < P; i++){
		cin >> id >> score; 
		if(score >= 200) {
			ma[id] = cnt++;
			v.push_back(node{id, score, -1, -1, 0});
		}
	}
	for(int i = 0; i < M; i++){
		cin >> id >> score; 
		if(ma[id] != 0) v[ma[id] - 1].gmid = score;	
	}
	for(int i = 0; i < N; i++){
		cin >> id >> score; 
		if(ma[id] != 0){
			int temp = ma[id] - 1;
			v[temp].gfin = v[temp].gg = score;
			if(v[temp].gmid > v[temp].gg)
				v[temp].gg = int(v[temp].gmid * 0.4 + v[temp].gfin * 0.6 + 0.5);
		} 		
	}
	for(int i = 0; i < v.size(); i++)
		if(v[i].gg >= 60) ans.push_back(v[i]);
	sort(ans.begin(), ans.end(), cmp);
	for(int i = 0; i < ans.size(); i++)
		printf("%s %d %d %d %d\n", ans[i].name.c_str(), ans[i].gp, ans[i].gmid, ans[i].gfin, ans[i].gg);
	return 0;
}