【PAT】A1025 PAT Ranking

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
struct node
{
	string name;
	int score;
	int flag;
	int rank;
	int ranklocal;
};
int judge(node a,node b)
{
	if (a.score == b.score)
		return a.name < b.name;
	return a.score > b.score;
}
int main()
{
	int n;
	cin >> n;
	int k = 0, k1 = 0, i = 0, flag = 1, start = 0,j=0;
	node *s = new node[1000];
	while (n--)
	{
		cin >> k1;
		k += k1;
		for (; i < k; i++)
		{
			cin >> s[i].name >> s[i].score;
			s[i].flag = flag;
		}
		i = k;
		flag++;
		sort(s + start, s + k, judge);
		int count = 1;
		for (j = start; j < k; j++)
		{
			if (j>start&& (s[j].score == s[j - 1].score))
				s[j].ranklocal = s[j-1].ranklocal;
			else
			{
				s[j].ranklocal = count;
			}
			count++;
		}
		start = k;
	}
	cout << k << endl;
	sort(s, s + k, judge);
	for (i = 0; i < k; i++)
	{
		if (i > 0 && s[i].score == s[i - 1].score)
		{
			s[i].rank = s[i - 1].rank;
			cout << s[i].name << " " << s[i].rank << " " << s[i].flag << " " << s[i].ranklocal << endl;
		}
		else
		{
			s[i].rank = i+1;
			cout << s[i].name << " " << s[i].rank << " " << s[i].flag << " " << s[i].ranklocal << endl;
		}
	}
	system("pause");
	return 0;
}