PAT A1153(测试点3，4运行超时)

1. 第三个使用map存储会超时，用unordered_map就更快
2. 排序传参推荐使用引用传参，这样更快，养成好习惯
3. 改用scanf，printf
   错误代码如下：

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

int n, m, type;
string term;
struct Node{
	string number;
	int score;
}node[10010];
bool cmp(const Node& a, const Node& b) {
	return a.score != b.score ? a.score > b.score : a.number < b.number;
} 
int main() {
	cin >> n >> m;
	for(int i = 0; i < n; i++)
		cin >> node[i].number >> node[i].score;
	for(int i = 1; i <= m; i++) {
		bool flag = false;
		vector<Node> result;
		cin >> type >> term;
		cout << "Case " << i << ": " << type << " " << term << endl;
		if(type == 1) {
			for(int j = 0; j < n; j++) {
				if(node[j].number[0] == term[0]) {
					result.push_back(node[j]);
					flag = true;
				}
			}
		} else if(type == 2) {
			int ans = 0, sum = 0;
			for(int j = 0; j < n; j++) {
				if(node[j].number.substr(1, 3) == term) {
					ans ++;
					sum += node[j].score;
					flag = true;
				}
			}
			if(flag) cout << ans << " " << sum << endl;
		} else {
			map<string, int> mp;
			for(int j = 0; j < n; j++) {
				if(node[j].number.substr(4, 6) == term) {
					mp[node[j].number.substr(1, 3)]++;
					flag = true;
				}
			}
			for(auto it : mp) result.push_back({it.first, it.second});
		}
		sort(result.begin(), result.end(), cmp);
		for(int j = 0; j < result.size(); j++)
			cout << result[j].number << " " << result[j].score << endl;
		if(flag == false) cout << "NA" << endl;
	}
	return 0;
}

AC代码

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

int n, m, type;
string term;
struct Node{
	string number;
	int score;
}node[10010];
bool cmp(const Node &a, const Node &b) {
	return a.score != b.score ? a.score > b.score : a.number < b.number;
} 
int main() {
	cin >> n >> m;
	for(int i = 0; i < n; i++)
		cin >> node[i].number >> node[i].score;
	for(int i = 1; i <= m; i++) {
		bool flag = false;
		vector<Node> result;
		cin >> type >> term;
        printf("Case %d: %d %s\n", i, type, term.c_str());
		if(type == 1) {
			for(int j = 0; j < n; j++) {
				if(node[j].number[0] == term[0]) {
					result.push_back(node[j]);
					flag = true;
				}
			}
		} else if(type == 2) {
			int ans = 0, sum = 0;
			for(int j = 0; j < n; j++) {
				if(node[j].number.substr(1, 3) == term) {
					ans ++;
					sum += node[j].score;
					flag = true;
				}
			}
			if(flag) printf("%d %d\n", ans, sum);
		} else {
			unordered_map<string, int> mp;
			for(int j = 0; j < n; j++) {
				if(node[j].number.substr(4, 6) == term) {
					mp[node[j].number.substr(1, 3)]++;
					flag = true;
				}
			}
			for(auto it : mp) result.push_back({it.first, it.second});
		}
		sort(result.begin(), result.end(), cmp);
		for(int j = 0; j < result.size(); j++)
            printf("%s %d\n",result[j].number.c_str(), result[j].score);
		if(flag == false) printf("NA\n");
	}
	return 0;
}