排序
题意
输出四种排序方式中,排名最好的名次和排序方式。
可以先用向量对四种排序方式分别排序,然后把排序的名次放入结构体中,再从这些名次中挑选最小的名次进行输出。
注意,有相同成果的排名需要相同,而不是简单的加1
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <cctype>
#include <unordered_map>
#include <map>
using namespace std;
typedef pair<int, int> PII;
const int N = 245;
struct country{
int g, m, pg, pm, ind, rank; //四种排名
}E[N];
bool cmp1(PII a, PII b){
return a.first > b.first;
}
bool cmp2(pair<double, int> a, pair<double, int> b){
return a.first > b.first;
}
vector<PII> go, me;
vector<pair<double, int>> peg, pem;
int main(){
int n, m, Gold, Medal, People;
cin>>n>>m;
for(int i = 0; i < n; i++){
cin>>Gold>>Medal>>People;
go.push_back({Gold, i});
me.push_back({Medal, i});
peg.push_back({Gold*1.0/People, i});
pem.push_back({Medal*1.0/People, i});
}
sort(go.begin(), go.end(), cmp1);
sort(me.begin(), me.end(), cmp1);
sort(peg.begin(), peg.end(), cmp2);
sort(pem.begin(), pem.end(), cmp2);
for(int i = 0; i < n; i++){ //具有相同成果的 处于同一排名
//金牌
int ida = go[i].second;
if(i == 0 || go[i-1].first != go[i].first){
E[ida].g = i + 1;
}else E[ida].g = E[go[i-1].second].g;
//奖牌
int idb = me[i].second;
if(i == 0 || me[i-1].first != me[i].first){
E[idb].m = i + 1;
}else E[idb].m = E[me[i-1].second].m;
//人均金牌
int idc = peg[i].second;
if(i == 0 || peg[i-1].first != peg[i].first){
E[idc].pg = i + 1;
}else E[idc].pg = E[peg[i-1].second].pg;
//人均奖牌
int idd = pem[i].second;
if(i == 0 || pem[i-1].first != pem[i].first){
E[idd].pm = i + 1;
}else E[idd].pm = E[pem[i-1].second].pm;
}
for(int i = 0; i < n; i++){
E[i].rank = 0x3f3f;
if(E[i].g < E[i].rank){
E[i].rank = E[i].g;
E[i].ind = 1;
}
if(E[i].m < E[i].rank){
E[i].rank = E[i].m;
E[i].ind = 2;
}
if(E[i].pg < E[i].rank){
E[i].rank = E[i].pg;
E[i].ind = 3;
}
if(E[i].pm < E[i].rank){
E[i].rank = E[i].pm;
E[i].ind = 4;
}
}
int x;
for(int i = 0; i < m; i++){
cin>>x;
if(i==0) cout<<E[x].rank<<":"<<E[x].ind;
else cout<<" "<<E[x].rank<<":"<<E[x].ind;
}
return 0;
}