【PAT 甲級】1025 PAT Ranking

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.

輸入格式：

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.

輸出格式：

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.

輸入例子：

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

輸出例子：

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

我的思路

結構體，排序輸出（指定cmp特定排序函數）。

注意字符串比較大小用strcmp(a,b)，當a<b時返回負數，a=b時返回0。

我的代碼

#include <iostream>
#include <cstdio> 
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

//考生結構體 
struct Testees
{
	char num[14];
	int score;
	int location_number;
	int local_rank;
};

bool cmp(Testees a, Testees b)
{
	if (a.score != b.score)
	{
		return a.score>b.score;  //若分數不同，從大到小 
	}else return strcmp(a.num, b.num)<0;   //若分數相同，按考生號從小到大 
}

int main()
{
	Testees stu[30010]; //最多不超過300*100的考生 
	int N, number=0, c, K, j;
	scanf("%d",&N);  //考場數 
	
	for(int i=1;i<=N;i++)
	{
		scanf("%d",&K);  //該考場的考生人數 
		
		for(j=number+1;j<=number+K;j++)
		{  //輸入一考場的考生信息 
			scanf("%s %d", &stu[j].num, &stu[j].score);
			stu[j].location_number = i;  //考場號
		}
		sort(stu+number+1,stu+number+K+1,cmp);  //同一考場內排序 
		
		c=1;
		for(j=number+1;j<=number+K;j++)
		{
			if((j!=number+1)&&(stu[j].score==stu[j-1].score))
			{
				c = stu[j-1].local_rank;  //若分數相同，排名數相同				
			}else{
				c = j-number;
			}
			stu[j].local_rank = c;  //考生在本考場的排名 
		}
		
		number += K;  //總共的考生數 
	}
	
	c=1;
	sort(stu+1, stu+number+1,cmp);
	printf("%d\n",number);
	for(int i=1; i<=number; i++)
	{
	    if((i!=1)&&(stu[i].score!=stu[i-1].score))
		{
			c = i;  //若分數相同，排名數相同				
		}
		printf("%s %d %d %d\n", stu[i].num, c, stu[i].location_number, stu[i].local_rank);
	} 
	
	return 0;
}