1085 PAT单位排行 （25 分）

#include<iostream>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;
struct school{
	string sch;
	float sum;
	int num;
};
int cmp(school a,school b){
	if(a.sum == b.sum&&a.num == b.num)
		return a.sch<b.sch;
	else return  a.sum!=b.sum ? a.sum > b.sum : a.num < b.num;
}
map<string,float> s_sum;
map<string,int> s_n;
int main(){
	int N,k=1;
	scanf("%d",&N);
	vector<school> out;
	for(int i=0;i<N;i++){
		string a,c;
		float b;
		cin>>a>>b>>c;
		transform(c.begin(),c.end(),c.begin(),::towlower);
		if(a[0] == 'B') 	b=1.00000*b/1.5;//这个地方如果是1.0的话会出错测试点5
		if(a[0] == 'A') 	b=1.00000*b;
		if(a[0] == 'T') 	b=1.50000*b;
		if(	s_sum[c]==0){
			school t={c,0,0};
			out.push_back(t);
			s_sum[c]=k++;
		}
		out[s_sum[c]-1].sum+=b;
		out[s_sum[c]-1].num++;
	}
	k--;
	for(int i=0;i<k;i++) out[i].sum=int(out[i].sum);
	sort(out.begin(),out.end(),cmp);
	printf("%d\n",k);
	printf("%d %s %d %d\n",1,out[0].sch.c_str(),int(out[0].sum),out[0].num);
	int j=1;
	for(int i=1;i<k;i++){
		if(int(out[i].sum)!=int(out[i-1].sum)) j=i+1;
		printf("%d %s %d %d\n",j,out[i].sch.c_str(),int(out[i].sum),out[i].num);

	}
	
}