PAT (Advanced Level) 1025. PAT Ranking (25)

简单题。

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<string>
#include<vector>
using namespace std;

const int maxn=;
int n,tot=;
int sz[maxn];
struct X
{
    string id;
    int c;
    int ans1,ans2,ans3;
}s[+];

bool cmp(const X&a,const X&b)
{
    return a.c>b.c;
}

bool cmp1(const X&a,const X&b)
{
    if(a.ans1==b.ans1) return a.id<b.id;
    return a.ans1<b.ans1;
}

int main()
{
    scanf("%d",&n); int sum=;
    for(int i=;i<=n;i++)
    {
        scanf("%d",&sz[i]);
        for(int j=;j<=sz[i];j++)
        {
            ++tot;
            cin>>s[tot].id;
            cin>>s[tot].c;
            s[tot].ans2=i;
        }
        sort(s+sum+,s++tot,cmp);
        s[sum+].ans3=;
        for(int i=sum+;i<=tot;i++)
        {
            if(s[i].c==s[i-].c) s[i].ans3=s[i-].ans3;
            else s[i].ans3=i-sum;
        }
        sum=tot;
    }
    sort(s+,s+tot+,cmp);
    s[].ans1=;
    for(int i=;i<=tot;i++)
    {
        if(s[i].c==s[i-].c) s[i].ans1=s[i-].ans1;
        else s[i].ans1=i;
    }
    sort(s+,s+tot+,cmp1);

    printf("%d\n",tot);
    for(int i=;i<=tot;i++)
    {
        cout<<s[i].id;
        printf(" %d %d %d\n",s[i].ans1,s[i].ans2,s[i].ans3);
    }
    return ;
}