PAT甲级1141

PAT甲级1141

题目大意：给出各个考生PAT的成绩，甲级1，顶级1.5，乙级/1.5，统计每个学校总共拿了多少分以及一共有多少成员参加。先输出学校总数，然后按照总分从高到低排列，总分相同按照参赛人数从小到大排列，若参赛人数也一样则按照学校字母序排列。
map保存每个学校总分以及成员，遍历统计即可。注意这里统计分数要用double型，不然会损失精度测试点5不通过。

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

struct School{
	string name;
	int score,member,rank;
};
bool cmp(School a,School b){
	if(a.score!=b.score) return a.score>b.score;
	else if(a.member!=b.member) return a.member<b.member;
	else return a.name<b.name;
}
map <string,int> member;
map<string,double> school;
string toLower(string a){
	for(int i=0;i<a.length();i++){
		a[i]=tolower(a[i]);
	}
	return a;
}
int main(){
	int n,tmpscore,cnt=1,same=1;
	string tmpid,tmpschool;
	scanf("%d",&n);
	vector<School> v;
	set<string> sc;
	for(int i=0;i<n;i++){
		cin>>tmpid>>tmpscore>>tmpschool;
		tmpschool=toLower(tmpschool);
		sc.insert(tmpschool);
		if(tmpid[0]=='T')
			school[tmpschool]+=(tmpscore*1.5);
		else if(tmpid[0]=='A')
			school[tmpschool]+=tmpscore;
		else school[tmpschool]+=(tmpscore/1.5);
		member[tmpschool]++;
	}
	for(auto it:sc){
		School tmp;
		tmp.name=it;
		tmp.score=(int)school[it];
		tmp.member=member[it];
		v.push_back(tmp);
	}
	sort(v.begin(),v.end(),cmp);
	printf("%d\n",v.size());
	for(int i=0;i<v.size();i++){
		if(i==0) cout<<cnt<<" "<<v[i].name<<" "<<v[i].score<<" "<<v[i].member<<endl;
		else{
			if(v[i].score!=v[i-1].score){
				cnt+=same;
				same=1;
			}else same++;
			cout<<cnt<<" "<<v[i].name<<" "<<v[i].score<<" "<<v[i].member<<endl;
		}
	}
	system("pause");
	return 0;
}