1025 PAT Ranking (25 分) 难度: 一般 / 知识点: 排序

Posted 2021-10-05 辉小歌

https://pintia.cn/problem-sets/994805342720868352/problems/994805474338127872

#include<bits/stdc++.h>
using namespace std;
int n,k;
struct node
{
    string id;
    int score,a,b,c;
}temp;
bool cmp(node a,node b)
{
    if(a.score==b.score) return a.id<b.id;
    return a.score>b.score;
}
vector<node>ve[105],ans;
int main(void)
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>k;
        for(int j=1;j<=k;j++)
        {
            string id;
            int score;
            cin>>id>>score;
            temp.id=id,temp.score=score,temp.b=i;
            ve[i].push_back(temp);
        }
        sort(ve[i].begin(),ve[i].end(),cmp);
        int cnt=0;
        for(int j=0;j<k;j++)//处理地区排名
        {
            if(j&&ve[i][j].score==ve[i][j-1].score) ve[i][j].c=cnt+1;
            else ve[i][j].c=j+1,cnt=j;
            ans.push_back(ve[i][j]);//记录到总的人里面
        }
    }
    sort(ans.begin(),ans.end(),cmp);
    int cnt=0;
    cout<<ans.size()<<endl;
    for(int i=0;i<ans.size();i++)
    {
        if(i&&ans[i].score==ans[i-1].score) 
            printf("%s %d %d %d\\n",ans[i].id.c_str(),cnt+1,ans[i].b,ans[i].c);
        else 
            printf("%s %d %d %d\\n",ans[i].id.c_str(),i+1,ans[i].b,ans[i].c),cnt=i;
    }
    return 0;
}