[PAT甲] 1025 PAT Ranking (25 分)

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct student{
	char number[15];
	int score;
	int local_rank;
	int location_num;
}stu[30001];
bool cmp(student a,student b);

int main(){
	int n,num=0; 
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int m;
		scanf("%d",&m);
		for(int j=0;j<m;j++){
			scanf("%s %d",stu[num].number,&stu[num].score);
			stu[num].location_num=i+1;//考场号 
			num++;
		}
		sort(stu+num-m,stu+num,cmp);
		stu[num-m].local_rank=1;
		for(int j=1;j<m;j++){//local_rank
			if(stu[num-m+j-1].score==stu[num-m+j].score){
				stu[num-m+j].local_rank=stu[num-m+j-1].local_rank;
			}else{
				stu[num-m+j].local_rank=j+1;
			}
		}
	}
	
	sort(stu,stu+num,cmp);
	int rank=1,flag=1;
	printf("%d\n",num);
	for(int i=0;i<num;i++){
		printf("%s ",stu[i].number);
		if(flag==1){//rank;
			flag=0;
			printf("%d ",rank);
		}else{
			if(stu[i-1].score!=stu[i].score) rank=i+1;
			printf("%d ",rank);
		}
		printf("%d %d\n",stu[i].location_num,stu[i].local_rank);
	}
}

bool cmp(student a,student b){
	if(a.score!=b.score) return a.score>b.score;
	else return strcmp(a.number,b.number)<0;
}