1153 Decode Registration Card of PAT (25 分)难度: 一般 / 知识点: 排序 模拟

Posted 2021-12-22 辉小歌

https://pintia.cn/problem-sets/994805342720868352/problems/1071785190929788928

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+10;
struct node

	string id,day;
	int test,score;
temp;
struct demo

	int id,cnt;
;
bool cmp(node a,node b)

	if(a.score==b.score) return a.id<b.id;
	return a.score>b.score;

bool cmp1(demo a,demo b)

	if(a.cnt==b.cnt) return a.id<b.id;
	return a.cnt>b.cnt;

vector<node>ve[3]; 
map<int,int>mp,val;
int n,m;
void print(int k)

	for(int i=0;i<ve[k].size();i++) 
	printf("%s %d\\n",ve[k][i].id.c_str(),ve[k][i].score);

int main(void)

	cin>>n>>m;
	for(int i=0;i<n;i++)
	
		string s; int score;
		cin>>s; scanf("%d",&score);
		temp.id=s;
		temp.day=s.substr(4,6);
		temp.score=score;
		temp.test=stoi(s.substr(1,3));
		if(s[0]=='A') ve[0].push_back(temp);
		if(s[0]=='B') ve[1].push_back(temp);
		if(s[0]=='T') ve[2].push_back(temp);
		mp[temp.test]++;
		val[temp.test]+=score;
	
	for(int i=0;i<3;i++) sort(ve[i].begin(),ve[i].end(),cmp);
	for(int i=1;i<=m;i++)
	
		int k; scanf("%d",&k);
		if(k==1)
		
			char s; scanf(" %c",&s);
			printf("Case %d: %d %c\\n",i,k,s);
			int op=0;
			if(s=='A')   op=0;
			else if(s=='B') op=1;
			else  op=2;
			print(op);
			if(ve[op].size()==0) puts("NA");
		
		else if(k==2)
		
			int a; scanf("%d",&a);
			printf("Case %d: %d %d\\n",i,k,a);
			if(mp[a]) printf("%d %d\\n",mp[a],val[a]);
			else puts("NA");
		
		else 
		
			string s; cin>>s;
			printf("Case %d: %d %s\\n",i,k,s.c_str());
			vector<demo>ans;
			map<int,int>cnt;
			for(int i=0;i<3;i++)
				for(int j=0;j<ve[i].size();j++)
					if(ve[i][j].day==s) cnt[ve[i][j].test]++;
			for(auto i=cnt.begin();i!=cnt.end();i++)
			
				ans.push_back(i->first,i->second);
			
			sort(ans.begin(),ans.end(),cmp1);
			if(ans.size())
			for(int i=0;i<ans.size();i++) printf("%d %d\\n",ans[i].id,ans[i].cnt);
			else puts("NA");
		
	
	return 0;