AC代码
#include<bits/stdc++.h>
using namespace std;
struct Testee{
string id;
int frank,lnum,lrank,score;
}t[30010];
int cn=0;
bool cmp(Testee a,Testee b)
{
if(a.score==b.score) return a.id<b.id;
else return a.score>b.score;
}
int main()
{
int n,k,score;
string id;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&k);
for(int j=0;j<k;j++)
{
cin>>id;
scanf("%d",&score);
t[cn].id=id;
t[cn].lnum=i;
t[cn++].score=score;
}
sort(t+cn-k,t+cn,cmp);
t[cn-k].lrank=1;
for(int j=1;j<k;j++)
{
int v=cn-k+j;
if(t[v].score==t[v-1].score)
{
t[v].lrank=t[v-1].lrank;
}
else {
t[v].lrank=j+1;
}
}
}
sort(t,t+cn,cmp);
t[0].frank=1;
for(int i=1;i<cn;i++)
{
if(t[i].score==t[i-1].score)
{
t[i].frank=t[i-1].frank;
}
else{
t[i].frank=i+1;
}
}
printf("%d\n",cn);
for(int i=0;i<cn;i++)
{
cout<<t[i].id<<" "<<t[i].frank<<" "<<t[i].lnum<<" "<<t[i].lrank<<endl;
}
return 0;
}