PAT B 1095

There is a point overtime, cout replaced prinft just fine

Three inputs are required by each processing times: storing a first vector with a requirement of a three lines; a second map storage requirements; copy storage map further third requirement, when the query to the output vector reordering . Write a cmp will be able to meet the first requirement ordering and third requirements.

#include <bits/stdc++.h>
using namespace std;
struct listnode{
	int num,allscore;
};
struct mpnode{
	map<string,int> mpp;
};
bool cmp(pair<string,int>& a,pair<string,int>& b){
	if(a.second!=b.second) return a.second>b.second;
	else return a.first<b.first;
}
int main(){
    int n,m,x;
	string num,cur;
	cin >> n >> m;
	vector<vector<pair<string,int>>> vec(3);
	map<string,listnode> mapp;
	map<string,mpnode> date;
	for(int i=0;i<n;i++){
		cin >> num >> x;
		if(num[0]=='A') vec[0].push_back(make_pair(num,x));
		else if(num[0]=='B') vec[1].push_back(make_pair(num,x));
		else vec[2].push_back(make_pair(num,x));
		cur = num.substr(1,3);
		mapp[cur].num++;
		mapp[cur].allscore += x;
		date[num.substr(4,6)].mpp[cur]++;
	}
	for(int i=0;i<3;i++) sort(vec[i].begin(),vec[i].end(),cmp);
	for(int i=0;i<m;i++){
		cin >> x >> num;
		printf("Case %d: %d %s\n",i+1,x,num.c_str());
		switch(x){
			case 1:{
				int j = num[0]=='T'?2:num[0]-'A';
				if(vec[j].size()==0) printf("NA\n");
				else for(auto iter=vec[j].begin();iter!=vec[j].end();iter++)
					printf("%s %d\n",iter->first.c_str(),iter->second);
				break;
			}
			case 2:{
				if(mapp[num].num==0) printf("NA\n");
				else printf("%d %d\n",mapp[num].num,mapp[num].allscore);
				break;
			}
			case 3:{
				vector<pair<string,int>> vvv(date[num].mpp.begin(),date[num].mpp.end());
				sort(vvv.begin(),vvv.end(),cmp);
				if(vvv.size()==0) printf("NA\n");
				else for(auto iter=vvv.begin();iter!=vvv.end();iter++)
					printf("%s %d\n",iter->first.c_str(),iter->second);
				break;
			}
			default: continue;
		}
	}
	return 0;
}