1012 The Best Rank (25 分) 感觉这题蛮复杂

代码长度还是可以写个函数减少20几行左右。
勉强AC

#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
#include<map>
using namespace std;
struct Rank {
	int rankA, rankC, rankM, rankE;
};
int minn(int a, int b, int c, int d) {
	return min(min(min(a, b),c),d);
}
void PrintId(map<int, Rank>VR, int m) {
	if (VR.find(m) == VR.end())printf("N/A\n");
	else {
		int min = minn(VR[m].rankA, VR[m].rankC, VR[m].rankE, VR[m].rankM);
		if (VR[m].rankA == min)printf("%d A\n", VR[m].rankA);
		else if (VR[m].rankC == min)printf("%d C\n", VR[m].rankC);
		else if (VR[m].rankM == min)printf("%d M\n", VR[m].rankM);
		else printf("%d E\n", VR[m].rankE);
	}
}
int main() {
	map<int, vector<int> >Cid, Mid, Eid, Aid;
	map<int, Rank>VR;
	Rank tmp;
	tmp.rankA = 0; tmp.rankC = 0; tmp.rankE = 0; tmp.rankM = 0;
	int Id, C, M, E, A, N, M1;
	scanf("%d %d", &N, &M1);
	for (int i = 0; i < N; i++) {
		scanf("%d %d %d %d", &Id, &C, &M, &E);
		A = (float)((float)C + (float)M + (float)E+1.5) / 3;
		Cid[C].push_back(Id); Mid[M].push_back(Id); Eid[E].push_back(Id); Aid[A].push_back(Id);
		VR[Id] = tmp;
	}auto itA = Aid.begin(); auto itC = Cid.begin(); auto itM = Mid.begin(); auto itE = Eid.begin();
	int ia = N+1, ic = N+1, im = N+1, ie = N+1, sa, sc, sm, se;
	for (int i = N; i >= 1; i--) {
		if (itA != Aid.end()) {
			sa = itA->second.size();ia -= sa;
			while (itA->second.size()) {
				VR[itA->second[itA->second.size() - 1]].rankA = ia; itA->second.pop_back();
			}itA++;
		}
		if (itC != Cid.end()) {
			sc = itC->second.size(); ic -= sc;
			while (itC->second.size()) {
				VR[itC->second[itC->second.size() - 1]].rankC = ic; itC->second.pop_back();
			}itC++;
		}
		if (itM != Mid.end()) {
			sm = itM->second.size(); im -= sm;
			while (itM->second.size()) {
				VR[itM->second[itM->second.size() - 1]].rankM = im; itM->second.pop_back();
			}itM++;
		}
		if (itE != Eid.end()) {
			se = itE->second.size(); ie -= se;
			while (itE->second.size()) {
				VR[itE->second[itE->second.size() - 1]].rankE = ie; itE->second.pop_back();
			}itE++;
		}
	}
	for (int i = 0; i < M1; i++) {
		scanf("%d", &N);
		PrintId(VR, N);
	}
	return 0;
}