1025 PAT Ranking

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;


unordered_map<string,int>kao,ha,p1,p2;
int n;
vector<string>arr;


int cmp(string a,string b){
	if(ha[a]==ha[b])return a<b;
	return ha[a]>ha[b];
}

int main(){
    cin.tie(0);
    cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		int t;
		cin>>t;
		vector<string>tt;
		while(t--){
			string a;
			cin>>a;
			kao[a]=i;
			tt.push_back(a);
			cin>>ha[a];
		}
		
		sort(tt.begin(),tt.begin()+tt.size(),cmp);
		p1[tt[0]]=1;
		arr.push_back(tt[0]);
		for(int j=1;j<tt.size();j++){
			
				arr.push_back(tt[j]); 
				if(ha[tt[j-1]]==ha[tt[j]])p1[tt[j]]=p1[tt[j-1]];
				else p1[tt[j]]=j+1;
			
		}
	
	}
	
	sort(arr.begin(),arr.begin()+arr.size(),cmp);
	p2[arr[0]]=1;
	for(int i=1;i<arr.size();i++){
		if(ha[arr[i]]==ha[arr[i-1]])p2[arr[i]]=p2[arr[i-1]];
		else p2[arr[i]]=i+1;
	}
	cout<<arr.size()<<endl;
	for(int i=0;i<arr.size();i++){
		cout<<arr[i]<<" "<<p2[arr[i]]<<" "<<kao[arr[i]]<<" "<<p1[arr[i]]<<endl;
	}
}