PAT乙级1085 PAT单位排行 (25 分)

Posted 2021-08-11 辉小歌

题目地址

#include<cstdio>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
struct node
{
	int A;
	int B;
	int T;
	int sum;
};
struct student
{
	string s;
	int sum;
	int cnt;
}Struct;
bool cmp(student a,student b)
{
	if(a.sum==b.sum)
	{
		if(a.cnt==b.cnt)
			return a.s<b.s;
		return a.cnt<b.cnt;
	}
	return a.sum>b.sum;
}
map<string,node>mp; 
vector<student> ve;
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++)
	{
		string a;
		int score;
		string b;
		cin>>a>>score>>b;
		for(int i=0;i<b.size();i++) b[i]=tolower(b[i]);
		if(a[0]=='A') mp[b].A+=score,mp[b].sum++; 
		if(a[0]=='B') mp[b].B+=score,mp[b].sum++;
		if(a[0]=='T') mp[b].T+=score,mp[b].sum++;
	}
	for(auto i=mp.begin();i!=mp.end();i++)
	{
		Struct.s=i->first,Struct.cnt=i->second.sum,Struct.sum=i->second.B/1.5+i->second.A+i->second.T*1.5;
		ve.push_back(Struct);
	}
	sort(ve.begin(),ve.end(),cmp);
	int k=1;
    cout<<ve.size()<<endl;
	for(int i=0;i<ve.size();i++)
	{
		cout<<k<<" "<<ve[i].s<<" "<<ve[i].sum<<" "<<ve[i].cnt<<endl;
		if(i+1<ve.size()&&ve[i].sum!=ve[i+1].sum) k=i+1+1;
	}
	return 0;
}