pat乙级1080

pat乙级1080

本题遇见个大坑，刚开始输出用的printf形式，输出的是乱码

错误的

正确的

printf中输出%s形式时在后面加了个.c_str()就对了，或者直接用cout输出也行

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;

struct Node
{
	string name;
	int gp;
	int gmid;
	int gfinal;
	int g;
};


int cmp(Node a, Node b)
{
	if (a.g != b.g)
		return a.g > b.g;
	else
		return a.name < b.name;
}


int main()
{
	int p, m, n, gp, gmid, gfinal, count = 1;
	string name;
	map<string, int> id;
	vector<Node> v, ans;//ans保存满足条件的
	cin >> p >> m >> n;
	while (p--)
	{
		cin >> name >> gp;
		if (gp >= 200)
		{
			id[name] = count++;
			v.push_back(Node{ name,gp,-1,-1,0 });
		}
	}

	while (m--)
	{
		cin >> name >> gmid;
		if (id[name] != 0)
		{
			v[id[name] - 1].gmid = gmid;
		}
	}
	while (n--)
	{
		cin >> name >> gfinal;
		if (id[name] != 0)
		{
			v[id[name] - 1].gfinal = gfinal;
			if (v[id[name] - 1].gmid > v[id[name] - 1].gfinal)
				v[id[name] - 1].g = round(v[id[name] - 1].gmid*0.4 + v[id[name] - 1].gfinal*0.6);
			else
				v[id[name] - 1].g = v[id[name] - 1].gfinal;
		}
	}


	for (int i = 0; i < v.size(); i++)
		if (v[i].g >= 60)
			ans.push_back(v[i]);

	sort(ans.begin(), ans.end(), cmp);

	for (int i = 0; i < ans.size(); i++)
		cout<< ans[i].name<<" " <<ans[i].gp<<" "<< ans[i].gmid<<" "<< ans[i].gfinal<<" " <<ans[i].g<<endl;

	return 0;
}