PAT | A1153 Decode Registration Card of PAT

#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <sstream>
#include <algorithm>

using namespace std;

struct Testee{
	string card;
	int score;
};

struct Site{
	string site;
	int num;
	Site(string s,int n){
		site = s;
		num = n;
	}
	Site(){}
};

bool cmp(Testee a,Testee b){
	if(a.score != b.score)
		return a.score > b.score;
	else
		return a.card < b.card;
}

bool cmp1(Site a,Site b){
	if(a.num != b.num)
		return a.num > b.num;
	return a.site < b.site;
}

vector<Testee> testees;

void process(int k,int n){
	int type;
	scanf("%d",&type);
	if(type == 1){
		char level;
		cin>>level;
		printf("Case %d: %d %c\n",k,type,level);
		int cnt = 0;
		for(int i = 0;i < n;i++){
			if(testees[i].card[0] == level){
				cnt++;
				printf("%s %d\n",testees[i].card.c_str(),testees[i].score);
			}
		}
		if(cnt == 0)
			printf("NA\n");
	}else if(type == 2){
		string site;
		cin>>site;
		printf("Case %d: %d %s\n",k,type,site.c_str());
		int cnt = 0; // 人数
		int sum = 0; // 总分数
		for(int i = 0;i < n;i++){
			if(testees[i].card.substr(1,3) == site){
				cnt++;
				sum += testees[i].score;
			}
		}
		if(cnt != 0)
			printf("%d %d\n",cnt,sum);
		else
			printf("NA\n");
	}else{
		string date;
		cin>>date;
		printf("Case %d: %d %s\n",k,type,date.c_str());
		unordered_map<string,int> sites;
		for(int i = 0;i < n;i++){
			if(testees[i].card.substr(4,6) == date){
				if(sites.find(testees[i].card.substr(1,3)) != sites.end()){
					sites[testees[i].card.substr(1,3)]++;
				}else{
					sites[testees[i].card.substr(1,3)] = 1;
				}
			}
		}
		vector<Site> temp;
		unordered_map<string,int>::iterator it = sites.begin();
		while(it != sites.end()){
			temp.push_back(Site(it->first,it->second));
			it++;
		}
		sort(temp.begin(),temp.end(),cmp1);
		for(int i = 0;i < temp.size();i++){
			printf("%s %d\n",temp[i].site.c_str(),temp[i].num);
		}
		if(temp.size() == 0)
			printf("NA\n");
	}
}

int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i = 0;i < n;i++){
		Testee temp;
		cin>>temp.card;
		scanf("%d",&temp.score);
		testees.push_back(temp);
	}
	sort(testees.begin(),testees.end(),cmp);
	for(int i = 1;i <= m;i++){
		process(i,n);
	}
	system("pause");
	return 0;
}