pat乙级1095

pat乙级1095

这道题得用unordered_map,否则最后两个点会超时，并且只能用printf输出不能用cout,否则最后两个点也会超时！

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

struct Node
{
	string name;
	int score;
};


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


int main()
{
	int n, m;
	cin >> n >> m;
	
	vector<Node> node(n);
	for (int i = 0; i < n; i++)
		cin >> node[i].name >> node[i].score;
	
	for(int k = 1; k <= m; k++)
	{
		int lei;
		string order;
		cin >> lei >> order;
		vector<Node> a;
		int count1 = 0, sum = 0;//记录2类型的
        printf("Case %d: %d %s\n", k, lei, order.c_str());
		if (lei == 1)
		{
			for (int i = 0; i < n; i++)
				if (node[i].name[0] == order[0])
					a.push_back(node[i]);
		}
		else if (lei == 2)
		{ 

			for (int i = 0; i < n; i++)
			{
				if (node[i].name.substr(1, 3) == order)
				{
					count1++;
					sum += node[i].score;
				}
			}
			if (count1 != 0)
				printf("%d %d\n", count1, sum);
		}
		else if (lei == 3)
		{
			unordered_map<string, int> mp;//记录符合日期的考场及人数
			for (int i = 0; i < n; i++)
				if (node[i].name.substr(4, 6) == order)
					mp[node[i].name.substr(1, 3)]++;

			for (auto it = mp.begin(); it != mp.end(); it++)
				a.push_back(Node{ it->first, it->second });
		}

		sort(a.begin(), a.end(), cmp);
		for (int i = 0; i < a.size(); i++)
		{
            printf("%s %d\n",a[i].name.c_str(), a[i].score);
		}

		if (((lei == 1 || lei == 3) && a.size() == 0) || (lei == 2 && count1 == 0))
			cout << "NA" << endl;

	}


	return 0;
}