1012 The Best Rank (25分)
这题其实我没看懂他到底是想要考什么耶,数据结构吗,应该hi可以用结构体,定义比较函数来做,我就直接写了,就是麻烦点,但是思路简单直接。
有个小坑是,当有两人并列时,下一个人的排名应该是并列者排名+并列人数,而不是直接+1.
#include<bits/stdc++.h>
using namespace std;
int main(){
int mm,n;
cin>>n>>mm;
vector<int> idx;
vector<pair<int,int>> c;
vector<pair<int,int>> m;
vector<pair<int,int>> e;
vector<pair<float,int>> a;
int sumc=0,summ=0,sume=0;
for(int i=0;i<n;i++){
int id,cg,mg,eg;
cin>>id>>cg>>mg>>eg;
idx.push_back(id);
c.push_back(make_pair(cg,id));
m.push_back(make_pair(mg,id));
e.push_back(make_pair(eg,id));
float ag=(cg+mg+eg)/3.0;
a.push_back(make_pair(ag,id));
}
vector<int> checkid(mm,0);
for(int i=0;i<mm;i++)
cin>>checkid[i];
sort(a.begin(),a.end(),greater<pair<float ,int>>());
sort(c.begin(),c.end(),greater<pair<int ,int>>());
sort(m.begin(),m.end(),greater<pair<int ,int>>());
sort(e.begin(),e.end(),greater<pair<int ,int>>());
unordered_map<int, vector<int>> r;
int rank=0;
for(int i=0;i<n;i++){
if(i==0 || a[i].first!=a[i-1].first)rank=i+1;
r[a[i].second].push_back(rank);
}
rank=0;
for(int i=0;i<n;i++){
if(i==0 || c[i].first!=c[i-1].first)rank=i+1;
r[c[i].second].push_back(rank);
}
rank=0;
for(int i=0;i<n;i++){
if(i==0 || m[i].first!=m[i-1].first)rank=i+1;
r[m[i].second].push_back(rank);
}
rank=0;
for(int i=0;i<n;i++){
if(i==0 || e[i].first!=e[i-1].first)rank=i+1;
r[e[i].second].push_back(rank);
}
unordered_map<int,vector<string>> res;
for(int i=0;i<n;i++){
if(r[idx[i]][0]<=r[idx[i]][1] && r[idx[i]][0]<=r[idx[i]][2] && r[idx[i]][0]<=r[idx[i]][3])
{ res[idx[i]].push_back(to_string(r[idx[i]][0]));res[idx[i]].push_back("A");}
if(r[idx[i]][1]<r[idx[i]][0] && r[idx[i]][1]<=r[idx[i]][2] && r[idx[i]][1]<=r[idx[i]][3])
{ res[idx[i]].push_back(to_string(r[idx[i]][1]));res[idx[i]].push_back("C");}
if(r[idx[i]][2]<r[idx[i]][1] && r[idx[i]][2]<r[idx[i]][0] && r[idx[i]][2]<=r[idx[i]][3])
{ res[idx[i]].push_back(to_string(r[idx[i]][2]));res[idx[i]].push_back("M");}
if(r[idx[i]][3]<r[idx[i]][1] && r[idx[i]][3]<r[idx[i]][2] && r[idx[i]][3]<r[idx[i]][0])
{ res[idx[i]].push_back(to_string(r[idx[i]][3]));res[idx[i]].push_back("E");}
}
unordered_map<int,vector<string>>::iterator iter;
for(int j=0;j<mm;j++){
iter=res.find(checkid[j]);
if(iter==res.end())cout<<"N/A"<<endl;
else cout<<res[checkid[j]][0]<<" "<<res[checkid[j]][1]<<endl;
}
return 0;
}