1025. PAT Ranking (25)

#define  _CRT_SECURE_NO_WARNINGS 
 
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<iostream> 
#include<algorithm>
#include<stdio.h> 
using namespace std;
struct Student
{
char ID[15];
int score;
//final_rank location_number local_rank
int final_rank, location_number, local_rank;
Student()
{
final_rank = 1; local_rank = 1;
}
};
bool cmp(Student a,Student b)
{
if (a.score == b.score)
return strcmp(a.ID , b.ID)<0;
else
return a.score > b.score;
}
Student stu[30000];
int main()
{
int N, K; 
int count = 0;
cin >> N;
for (int i = 0; i < N; i++)
{
cin >> K; 
for (int j = 0; j < K; j++)
{
cin >> stu[count+j].ID >> stu[count+j].score;
stu[count + j].location_number = i + 1;
stu[count + j].final_rank = 1;
stu[count + j].local_rank = 1;
}
sort(&stu[count], &stu[count + K], cmp);
for (int j = 1; j < K; j++)
{
if (stu[count + j].score == stu[count + j - 1].score)
stu[count + j].local_rank = stu[count + j - 1].local_rank;
else
stu[count + j].local_rank = j + 1;
}
count += K;
}
sort(stu, &stu[count], cmp);
cout << count << endl;
printf("%s %d %d %d\n",stu[0].ID,stu[0].final_rank,stu[0].location_number,stu[0].local_rank);
for (int i = 1; i < count; i++)
{
if (stu[i].score == stu[i - 1].score)
stu[i].final_rank = stu[i - 1].final_rank;
else
stu[i].final_rank = i + 1;
printf("%s %d %d %d\n", stu[i].ID, stu[i].final_rank, stu[i].location_number, stu[i].local_rank);
}
return 0;
}