pat甲级 1141 PAT Ranking of Institutions

模拟题，存储有点麻烦

用两个map存储，一个存学校人数，一个存分数，然后把两个map的内容，存在结构体中，用sort排序

#include<iostream>
#include<cstdio>
#include<cmath>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
map<string,double> mp;
map<string,int>mp1;
struct mapp{
	string a;
	int ts;
	int ns;
}m[maxn];
bool cmp(const mapp &a,const mapp &b){
	if(a.ts==b.ts&&a.ns==b.ns)
	  return a.a<b.a;
	else if(a.ts==b.ts)
	  return a.ns<b.ns;
	else 
	  return a.ts>b.ts;
}
int main(){
	int n;
	scanf("%d",&n);
	string id,s;
	int sc;
	for(int i=1;i<=n;i++){
	   cin>>id;
	   scanf("%d",&sc);
	   cin>>s;
	   for(int i=0;i<s.length();i++){
	    if(s[i]>='A'&&s[i]<='Z')
	   	  s[i]+=32;
	   }
	   if(id[0]=='A'){
	   	  mp[s]+=sc;
	   }
	   else if(id[0]=='B'){
	      mp[s]+=sc*1.0/1.5;
	   }
	   else{
	   	  mp[s]+=sc*1.5;
	   }
	   mp1[s]++;
	}
	map<string,double> ::iterator it=mp.begin();
	int cnt=0;
	for(;it!=mp.end();it++){
		m[++cnt]={it->first,(int)it->second,mp1[it->first]};
	}
	sort(m+1,m+1+cnt,cmp);
	printf("%d\n",cnt);
	cout<<1<<" "<<m[1].a<<" "<<m[1].ts<<" "<<m[1].ns<<endl;
	int rank=1;
	for(int i=2;i<=cnt;i++){
		if(m[i].ts!=m[i-1].ts)
		  rank=i;
		cout<<rank<<" "<<m[i].a<<" "<<m[i].ts<<" "<<m[i].ns<<endl;
	}
	return 0;
}