1141 PAT Ranking of Institutions (25 分)

知识点：排序题

版本1

耗时46分钟
注意score必须是按照整型排序，而不是浮点数排序。不然最后一个测试点会出错。

#include <cstdio>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <cstring>
#include <algorithm> 
#include <unordered_map>
#include <map>
using namespace std;
const int N = 1e5+5;
struct node{
	string school;
	int num;
	double score;
}E[N];
bool cmp(node a, node b){
	int u = a.score;
	int v = b.score;
	if(u != v) return u > v;
	else if(a.num != b.num) return a.num < b.num;
	return a.school < b.school;
}
int main(){
	int n,temp, idx = 0;
	double score;
	cin>>n;
	string id, sch;
	unordered_map<string, int > mp;
	for(int i = 0;i < n; i++){
		cin>>id>>score>>sch;
		for(auto &c: sch){
			c = tolower(c);
		}
		
		if(mp.count(sch)) {
			temp = mp[sch];
			E[temp].num++;
			if(id[0] == 'A') E[temp].score += score;
			if(id[0] == 'B') E[temp].score += score/1.5;
			else if(id[0] == 'T') E[temp].score += score*1.5;
		}
		else{
			mp[sch] = idx;
			if(id[0]== 'A') E[idx].score = score;
			if(id[0] == 'B') E[idx].score = score/1.5;
			else if(id[0] == 'T') E[idx].score = score*1.5;
			
			E[idx].school = sch;
			E[idx].num = 1;
			idx++;
		}
	}
	sort(E, E+idx, cmp);
	cout<<idx<<endl;
	if(idx) printf("1 %s %d %d\n", E[0].school.c_str(), (int)E[0].score, E[0].num);
	int rank = 1;
	for(int i = 1; i < idx; i++){
		int u = E[i-1].score;
		int v = E[i].score;
		if(u == v){
			printf("%d %s %d %d\n", rank, E[i].school.c_str(), v, E[i].num);
		}else{
			printf("%d %s %d %d\n",i+1, E[i].school.c_str(), v, E[i].num);
			rank = i+1;
		}
	}
	return 0;
}