1025.PAT Ranking

【题意】

        给出PAT几个考场的成绩情况，总结成一个最终成绩榜，给出榜中每个人的ID、总排名（可并列）、考试地点编号、分考场排名（可并列）。

【思路】

        分考场用一个vector，总成绩用一个vector，读入一个分考场就排个名，然后加入总成绩的vector，全读完后再对全部考生排名即可。

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

typedef struct
{
	string id;
	int score;
	int final_rank;
	int location_number;
	int local_rank;
}record;

bool cmp(record r1, record r2){
	if(r1.score>r2.score){
		return 1;
	}
	else if(r1.score==r2.score && r1.id<r2.id){
		return 1;
	}
	else{
		return 0;
	}
}

int main(int argc, char const *argv[])
{
	vector<record> local_records,final_records;
	int n,k;

	cin >> n;
	for(int i=1; i<=n; i++){
		local_records.clear();
		cin >> k;
		while(k--){
			record tmp;
			cin >> tmp.id >> tmp.score;
			tmp.location_number = i;
			local_records.push_back(tmp);
		}
		sort(local_records.begin(), local_records.end(), cmp);

		int cnt = 1;
		int preScore = 101;
		int preRank = 0;
		for(vector<record>::iterator it=local_records.begin(); it!=local_records.end(); it++){
			if((*it).score==preScore){
				(*it).local_rank = preRank;
				cnt++;
			}
			else{
				preRank += cnt;
				(*it).local_rank = preRank;
				cnt = 1;
				preScore = (*it).score;
			}
			final_records.push_back(*it);
		}
	}

	sort(final_records.begin(), final_records.end(), cmp);
	int cnt = 1;
	int preScore = 101;
	int preRank = 0;
	cout << final_records.size() << endl;
	for(vector<record>::iterator it=final_records.begin(); it!=final_records.end(); it++){
		if((*it).score==preScore){
			(*it).final_rank = preRank;
			cnt++;
		}
		else{
			preRank += cnt;
			(*it).final_rank = preRank;
			cnt = 1;
			preScore = (*it).score;
		}
		cout << (*it).id << " " << (*it).final_rank << " " << (*it).location_number << " " << (*it).local_rank << endl;
	}

	system("pause");
	return 0;
}