pat1012 The Best Rank

#include<cstdio>#include<iostream>#include<algorithm>#include<vector>#include<queue>#include<string>#include<cstring>#include<cmath>#include<map>#include<stack>#define N 10005#define ll long longusing namespace std;vector<pair<int,int> >s[4];pair<int,int>ans[2005];char ch[5] = "ACME";map<int,int>mp;int main(){int n,m,i,j,a,b,c,d,id;while(scanf("%d%d",&n,&m)!=EOF){int cnt = 0;for(i = 1;i<=n;i++){scanf("%d%d%d%d",&id,&a,&b,&c);if(!mp[id])mp[id] = ++cnt;s[0].push_back(make_pair(int(double(a+b+c)/3.0+0.5),mp[id]));s[1].push_back(make_pair(a,mp[id]));s[2].push_back(make_pair(b,mp[id]));s[3].push_back(make_pair(c,mp[id]));}for(i = 0;i<4;i++){int rk = 1;sort(s[i].begin(),s[i].end());for(j = n-1;j>=0;j--){id = s[i][j].second;if(j == n-1||s[i][j].first<s[i][j+1].first)rk = n-j;if(!i)ans[id] = make_pair(rk,i);else if(rk<ans[id].first)ans[id] = make_pair(rk,i);}}for(i = 0;i<m;i++){scanf("%d",&id);if(mp.find(id) == mp.end())printf("N/A\n");else printf("%d %c\n",ans[mp[id]].first,ch[ans[mp[id]].second]);}}    return 0;}