1025 PAT Ranking

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.

Sample Input:

2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85

Sample Output:

9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3
1234567890011 9 2 4
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<vector>
using namespace std;
struct student{
	char ID[15];
	int grade;
	int location;
	int location_rank;
};
bool cmp(const student&stu1,const student&stu2){
	if(stu1.grade == stu2.grade){
		if(strcmp(stu1.ID,stu2.ID) > 0){
			return true;
		}else{
			return false;
		}
	}else{
		return stu1.grade < stu2.grade;
	}
}
int main(){
	for(int n;scanf("%d",&n)!=EOF;){
		vector<student>vec_all;
		for(int i = 1;i <= n;i++){
			int k;
			scanf("%d",&k);
			vector<student>vec_local;
			while(k--){
				student temp;
				scanf("%s%d",temp.ID,&temp.grade);
				vec_local.push_back(temp);
			}
			sort(vec_local.begin(),vec_local.end(),cmp);
			//grade_flag 用于记录上一个学生的成绩，flag用于记录上一个学生的排名,成绩相同的学生排名一样。
			int grade_flag = vec_local[vec_local.size()-1].grade;
			int flag = 1;
			for(int j = vec_local.size()-1;j >= 0;j--){
				vec_local[j].location = i;
				//如果这个学生和上一个学生的成绩一样，那这个学生的排名和上一个学生的排名一样。
				if(vec_local[j].grade == grade_flag){
					vec_local[j].location_rank = flag;
				}else{
					//如果这个学生的成绩和上一个学生的成绩不一样，那说明他的排名是前面学生的总数+1
					grade_flag = vec_local[j].grade;
					vec_local[j].location_rank = vec_local.size() - j;
					flag = vec_local[j].location_rank;
				}
				vec_all.push_back(vec_local[j]);
			}
		}
		sort(vec_all.begin(),vec_all.end(),cmp);
		printf("%d\n",vec_all.size());
		int grade_flag = vec_all[vec_all.size()-1].grade;
		int flag = 1;
		for(int j = vec_all.size()-1;j >= 0;j--){
			printf("%s ",vec_all[j].ID);
			if(vec_all[j].grade == grade_flag){
				printf("%d ",flag);
			}else{
				grade_flag = vec_all[j].grade;
				flag = vec_all.size() - j;
				printf("%d ",flag);
			}
			printf("%d %d\n",vec_all[j].location,vec_all[j].location_rank);
		}
		
	}
	return 0;
}