1012 The Best Rank

#include<bits/stdc++.h>
using namespace std;
struct Node{
	int id;
	int score_a;
	int score_c;
	int score_m;
	int score_e;
	int ranka,rankc,rankm,ranke,rankbest; 
	int flag;
	string best;
};
bool cmp1(Node a,Node b){
	return a.score_a>b.score_a;
}
bool cmp2(Node a,Node b){
	return a.score_c>b.score_c;
}
bool cmp3(Node a,Node b){
	return a.score_m>b.score_m;
}
bool cmp4(Node a,Node b){
	return a.score_e>b.score_e;
}
int main()
{
	freopen("in.txt","r",stdin);
	int n,m;cin>>n>>m;vector<Node> ppp;ppp.resize(n);
	for(int i=0;i<n;i++){
		cin>>ppp[i].id>>ppp[i].score_c>>ppp[i].score_m>>ppp[i].score_e;
		ppp[i].score_a=ppp[i].score_c+ppp[i].score_m+ppp[i].score_e;
		ppp[i].flag=1;
	}
	sort(ppp.begin(),ppp.end(),cmp4);
	ppp[0].ranke=1;
	ppp[0].rankbest=ppp[0].ranke;
	ppp[0].best="E";
	for(int i=1;i<ppp.size();i++){
		if(ppp[i].score_e==ppp[i-1].score_e){
			ppp[i].ranke=ppp[i-1].ranke;
			ppp[i].rankbest=ppp[i].ranke;
			ppp[i].best='E';
		}else{
			ppp[i].ranke=i+1;
			ppp[i].rankbest=ppp[i].ranke;
			ppp[i].best='E';
		}
	}
	sort(ppp.begin(),ppp.end(),cmp3);
	ppp[0].rankm=1;
	if(ppp[0].rankbest>=ppp[0].rankm){
		ppp[0].rankbest=ppp[0].rankm;
		ppp[0].best="M";
	}
	for(int i=1;i<ppp.size();i++){
		if(ppp[i].score_m==ppp[i-1].score_m){
			ppp[i].rankm=ppp[i-1].rankm;
			if(ppp[i].rankbest>=ppp[i].rankm){
				ppp[i].rankbest=ppp[i].rankm;
				ppp[i].best="M";
			}
		}else{
			ppp[i].rankm=i+1;
			if(ppp[i].rankbest>=ppp[i].rankm){
				ppp[i].rankbest=ppp[i].rankm;
				ppp[i].best="M";
			}
		}
	}
	sort(ppp.begin(),ppp.end(),cmp2);
	ppp[0].rankc=1;
	if(ppp[0].rankbest>=ppp[0].rankc){
		ppp[0].rankbest=ppp[0].rankc;
		ppp[0].best="C";
	}
	for(int i=1;i<ppp.size();i++){
		if(ppp[i].score_c==ppp[i-1].score_c){
			ppp[i].rankc=ppp[i-1].rankc;
			if(ppp[i].rankbest>=ppp[i].rankc){
				ppp[i].rankbest=ppp[i].rankc;
				ppp[i].best="C";
			}
		}else{
			ppp[i].rankc=i+1;
			if(ppp[i].rankbest>=ppp[i].rankc){
				ppp[i].rankbest=ppp[i].rankc;
				ppp[i].best="C";
			}
		}
	}
	sort(ppp.begin(),ppp.end(),cmp1);
	ppp[0].ranka=1;
	if(ppp[0].rankbest>=ppp[0].ranka){
		ppp[0].rankbest=ppp[0].ranka;
		ppp[0].best="A";
	}
	for(int i=1;i<ppp.size();i++){
		if(ppp[i].score_a==ppp[i-1].score_a){
			ppp[i].ranka=ppp[i-1].ranka;
			if(ppp[i].rankbest>=ppp[i].ranka){
				ppp[i].rankbest=ppp[i].ranka;
				ppp[i].best="A";
			}
		}else{
			ppp[i].ranka=i+1;
			if(ppp[i].rankbest>=ppp[i].ranka){
				ppp[i].rankbest=ppp[i].ranka;
				ppp[i].best="A";
			}
		}
	}
	map<int,Node> mp;
	for(int i=0;i<ppp.size();i++){
		mp[ppp[i].id]=ppp[i];
	}
	for(int i=0;i<m;i++){
		int temp;cin>>temp;
		if(mp[temp].flag==0){
			cout<<"N/A"<<endl;
		}else{
			cout<<mp[temp].rankbest<<' '<<mp[temp].best<<endl;
		}
	}
	return 0;
}