PAT 甲级 —— 1012 The Best Rank

• 并列第一的排名情况是“1, 1, 3, 4, 5”，不是“1, 1, 2, 3, 4”

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

const char cla[] = {'E', 'M', 'C', 'A'};

struct NODE {
	int id;
	int score[4];
	NODE(int _id = 0, int _c = 0, int _m = 0, int _e = 0): id(_id) {
		score[0] = _e, score[1] = _m, score[2] = _c;
		score[3] = _c + _m + _e;
	}
};

int main() {
	int N, M;
	cin >> N >> M;
	vector<NODE> A;
	unordered_map<int, pair<int, int>> um;
	for (int i = 0; i < N; ++i) {
		int id, c, m, e;
		cin >> id >> c >> m >> e;
		A.emplace_back(id, c, m, e);
	}
	for (int i = 0; i < 4; ++i) {
		sort(A.begin(), A.end(), [i](const NODE& a, const NODE& b){ return a.score[i] > b.score[i]; });
		int rank = 1;
		for (int j = 0; j < N; ++j) {
			if (j > 0 && A[j].score[i] != A[j - 1].score[i]) rank = j + 1;
			if (i == 0 || um[A[j].id].first >= rank) um[A[j].id] = {rank, i};
		}
	}
	for (int i = 0; i < M; ++i) {
		int idx;
		cin >> idx;
		if (um.count(idx)) {
			cout << um[idx].first << " " << cla[um[idx].second] << endl;
		} else {
			cout << "N/A" << endl;
		}
	}
	return 0;
}