1025 PAT Ranking (25分)

1.用pair将号码和考场对应

2.每个考场和所有的都要存储

3.注意排名 和之前存储方式一样，考场和总的都要记录   rank 和cnt分别记录当前排名 当前排名一致个数

下标0-n-1是考场   n是总的

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
#include<set>
#include<map>
#include<sstream>

using namespace std;
typedef long long LL;
const int N =100+5;

typedef pair<string, int> PII;

map<int, vector<PII> > a[N], T;

int main() {
	int  n;
	
	cin >> n;

	int sum = 0;

	for(int i=0; i<n; i++){
		int k;
		string ns;
		int s;
		
		cin >> k;
		
		sum += k;
		
		for(int j=0; j<k; j++){
			cin >> ns >> s;
			a[i][s].push_back(make_pair(ns, i));
			a[n][s].push_back(make_pair(ns, i));
		}
	}
	cout << sum << endl;
	
	int cnt[n+1];
	int rank[n+1];
	
	for(int i=0; i<=n; i++){
		rank[i] = 1;
		cnt[i] = 0;
	}
	for(map<int, vector<PII> >:: reverse_iterator it=a[n].rbegin(); it!=a[n].rend(); it++){
		sort(it->second.begin(), it->second.end());
		
		for(vector<PII>::iterator it1=it->second.begin(); it1!= it->second.end(); it1++ ){
			cout << it1->first << " " << rank[n] << " " << it1->second+1 << " " << rank[it1->second] << endl;
			cnt[n]++;
			cnt[it1->second]++;
		}
		
		for(int i=0; i<=n; i++){
			rank[i] += cnt[i];
			cnt[i] = 0;
		}
	}
	
	return 0;
}