（算法练习）——PAT A1025

要求：
《算法笔记》P103
说明：
主要是sort函数的用法、cmp函数设定顺序的编写
代码：

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

struct Student{
	char id[15];
	int score;
	int location_number;
	int local_rank;
}stu[30010];

//排序函数的编写 
bool cmp(Student a,Student b){
	if(a.score != b.score) return a.score> b.score;  //先按分数从高到低排序 
	else return strcmp(a.id,b.id) <0;  //分数相同按准考证号从小到大排序 
} 

int main(){
	int n,k,num = 0;
	scanf("%d",&n);
	for(int i = 1;i <= n;i++){
		scanf("%d",&k);
		for(int j = 0;j <k;j++){
			scanf("%s %d",stu[num].id,&stu[num].score);
			stu[num].location_number = i;
			num++;
		}
		sort(stu+num-k,stu+num,cmp);
		stu[num-k].local_rank = 1;
		for(int j = num-k+1;j <num;j++){
			if(stu[j].score == stu[j - 1].score){
				stu[j].local_rank = stu[j - 1].local_rank;
			}
			else{
				stu[j].local_rank = j+1-(num-k);
			}
		}
	}
	printf("%d\n",num);
	sort(stu,stu+num,cmp);
	int r = 1;
	for(int i = 0;i < num;i++){
		if(i > 0 && stu[i].score != stu[i-1].score){
			r = i+1;
		}
		printf("%s ",stu[i].id);
		printf("%d %d %d\n",r,stu[i].location_number,stu[i].local_rank);
	}
	return 0;
	
}