题意:大概题意就是每个学生都有自己的序号id,以及C语言场景c,数学成绩m,英语成绩e,以及平均成绩a。题目会输出n个学生的id以及三门主科的成绩,气候跟寻m次询问,问某id的学生最佳成绩排名及科目名称。
思路:思路其实很简单,分四个数组存放每科所有学生的成绩再排个序即可。但需要注意两个坑点:1.在选取学生最高排名时必须按照a,c,m,e的优先级取最高排名科目(即每个成绩都排名第三,但必须输出 3 A)。2. 相同分数排名相同,但下一分数不会递补(即现在有 90、90、89的三个成绩,则气排名分别为1、1、3)。
AC代码:
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N = 1e5+10;
int n, m;
struct node{
int c, m, e, a;
};
map<string, node> mp;
vector<node> cc, mm, ee, aa;
map<int, int> gc, gm, ge, ga;
map<string, int> vis;
bool cmpc(node x, node y){
return x.c>y.c;
}
bool cmpm(node x, node y){
return x.m>y.m;
}
bool cmpe(node x, node y){
return x.e>y.e;
}
bool cmpa(node x, node y){
return x.a>y.a;
}
signed main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++){
string s; int x, y, z;
cin >> s >> x >> y >> z;
vis[s] = 1;
node tmp = {x, y, z, (x+y+z)/3};
mp[s] = tmp;
cc.push_back(tmp);
mm.push_back(tmp);
ee.push_back(tmp);
aa.push_back(tmp);
}
sort(cc.begin(), cc.end(), cmpc);
sort(mm.begin(), mm.end(), cmpm);
sort(ee.begin(), ee.end(), cmpe);
sort(aa.begin(), aa.end(), cmpa);
for(int i = 0; i < cc.size(); i ++){
if(!gc[cc[i].c]) gc[cc[i].c] = i+1;
}
for(int i = 0; i < mm.size(); i ++){
if(!gm[mm[i].m]) gm[mm[i].m] = i+1;
}
for(int i = 0; i < ee.size(); i ++){
if(!ge[ee[i].e]) ge[ee[i].e] = i+1;
}
for(int i = 0; i < aa.size(); i ++){
if(!ga[aa[i].a]) ga[aa[i].a] = i+1;
}
while(m--){
string s;
cin >> s;
if(!vis[s]){
cout << "N/A" << endl;
continue;
}
int pc = gc[mp[s].c], pm = gm[mp[s].m], pe = ge[mp[s].e], pa = ga[mp[s].a];
if(pa<=pc&&pa<=pm&&pa<=pe) cout << pa << " A" << endl;
else if(pc<=pm&&pc<=pe&&pc<=pa) cout << pc << " C" << endl;
else if(pm<=pc&&pm<=pe&&pm<=pa) cout << pm << " M" << endl;
else if(pe<=pc&&pe<=pm&&pe<=pa) cout << pe << " E" << endl;
// cout << mp[s].c << " " << mp[s].m << " " << mp[s].e << " " << mp[s].a << endl;
// cout << pc << " " << pm << " " << pe << " " << pa << endl << endl;
}
return 0;
}