PatA1025 pat ranking(25)

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct testee{
char id[15];//13 digits
int scr;
int locid;//location id
int ttlrk;//totalrank
int lclrk;//finalrank
}tstee[30010];
bool cmp(testee a,testee b){
if(a.scr!=b.scr) return a.scr>b.scr;
else return strcmp(a.id,b.id)<0;
}
int main(){
int n,sum=0,num,k=0;
int i,j;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&num);//testees num in each lo
for(j=0;j<num;j++){
tstee[k].locid=i;
scanf("%s %d",&tstee[k].id,&tstee[k].scr);
k++;
}
sort(tstee+sum,tstee+sum+num,cmp);// count local rank from sum to sum+num
tstee[sum].lclrk = 1;
for(j=1;j<num;j++){
if(tstee[sum+j].scr == tstee[sum+j-1].scr)tstee[sum+j].lclrk=tstee[sum+j-1].lclrk;
else tstee[sum+j].lclrk=j+1;
}
sum += num;

}


sort(tstee,tstee+sum,cmp);
tstee[0].ttlrk=1;
for(i=1;i<sum;i++){
if(tstee[i].scr == tstee[i-1].scr)tstee[i].ttlrk=tstee[i-1].ttlrk;
else tstee[i].ttlrk=i+1;
}
printf("%d\n",sum);
for(i=0;i<sum;i++){
printf("%s %d %d %d\n",tstee[i].id,tstee[i].ttlrk,tstee[i].locid,tstee[i].lclrk);
}
return 0;
}