算法笔记：PAT Ranking（C/C++）

转眼5天过去了，又连着5天没有更新了！
唉，时间过得真的好快，不知不觉就过的那么久了。
新的一天，要加油啊！
今天来看看sort()函数的使用实例。
题目描述：
有n个考场，每个考场有若干数量的考生。现在给出各个考场中考生的准考证号与分数，要求将所有考生按分数从高到低排序，并按顺序输出所有考生的准考证号、排名、考场号及考场内排名。

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

Input Specification:
Each input file contains one test case. For each case, the first line contains a positive number N (≤100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (≤300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

Output Specification:
For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:

registration_number final_rank location_number local_rank
The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

注意：这个题目中要求的排序方法是：分数不同的排名不同，分数相同的排名相同但是占用一个排位。

思路：在结构体类型Student中存放题目要求的信息(准考证号、排名、考场号以及考场内排名），依照题目要求，需要写一个排序函数cmp,规则如下：
1、当分数不同时，按分数从大到小排序。
2、否则，按准考证号从小到大排序。
即：需要写一个类似于下面的cmp函数：

bool cmp(Student a,Student b)
{
   
	if(a.score != b.score) return a.score>b.score;
	else return strcmp(a.id,b.<