PAT(Basic Level) 1085 PAT单位排行

1085 PAT单位排行（25 分）

每次 PAT 考试结束后，考试中心都会发布一个考生单位排行榜。本题就请你实现这个功能。

输入格式：

输入第一行给出一个正整数 N（≤10​5​​），即考生人数。随后 N 行，每行按下列格式给出一个考生的信息：

准考证号 得分 学校

其中准考证号是由 6 个字符组成的字符串，其首字母表示考试的级别：B代表乙级，A代表甲级，T代表顶级；得分是 [0, 100] 区间内的整数；学校是由不超过 6 个英文字母组成的单位码（大小写无关）。注意：题目保证每个考生的准考证号是不同的。

输出格式：

首先在一行中输出单位个数。随后按以下格式非降序输出单位的排行榜：

排名 学校 加权总分 考生人数

其中排名是该单位的排名（从 1 开始）；学校是全部按小写字母输出的单位码；加权总分定义为乙级总分/1.5 + 甲级总分 + 顶级总分*1.5的整数部分；考生人数是该属于单位的考生的总人数。

学校首先按加权总分排行。如有并列，则应对应相同的排名，并按考生人数升序输出。如果仍然并列，则按单位码的字典序输出。

实现代码如下:

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

struct student{//学生结构体 
	string stu_id;
	int stu_score;
	string stu_school;
};

struct school_Rank{//字典记录学校总学分与人数 
	double total_Score;
	int peopleNum;
};

struct node{//对学校进行排名进行展示 
	string stu_school;
	int total_Score;
	int peopleNum;	
};

void show_stu(student stu){
	cout<<stu.stu_id<<" "<<stu.stu_score<<" "<<stu.stu_school<<endl;
}

int cmpFun(node firstNode,node SecNode){
	if(firstNode.total_Score != SecNode.total_Score)
		return firstNode.total_Score > SecNode.total_Score;
	else if(firstNode.peopleNum != SecNode.peopleNum)
		return firstNode.peopleNum < SecNode.peopleNum;
	else 
		return firstNode.stu_school < SecNode.stu_school;
}

int main(){
	
	int n;
	cin>>n;
	
	student *stus = new student[n];
	
	for(int i=0;i<n;i++){
		cin>>stus[i].stu_id;
		cin>>stus[i].stu_score;
		cin>>stus[i].stu_school;
	}

	map<string,school_Rank> schoolMap;
	map<string,school_Rank>::iterator it;
	
	for(int i=0;i<n;i++){
		string strTmp = stus[i].stu_school;
		for(int j = 0;j < strTmp.length();j++)
			strTmp[j] = tolower(strTmp[j]);//将学校转为小写 
			
		it = schoolMap.find(strTmp);
		
		//不能直接单个计算分数乘除1.5,否则会错误，要拿总分来计算进行取整(double先保留小数部分) 
		if(it == schoolMap.end()){
			school_Rank school_temp; 
			school_temp.peopleNum = 1;
			if(stus[i].stu_id[0] == 'B')
				 school_temp.total_Score = (stus[i].stu_score / 1.5);
			else if(stus[i].stu_id[0] == 'T')	
				 school_temp.total_Score = (stus[i].stu_score * 1.5);
			else
				school_temp.total_Score = stus[i].stu_score;
			schoolMap.insert(pair<string,school_Rank>(strTmp,school_temp));
			
		}else{	
			school_Rank school_temp = schoolMap[strTmp];
			school_temp.peopleNum += 1;
			
			if(stus[i].stu_id[0] == 'B')
				 school_temp.total_Score += (stus[i].stu_score / 1.5);
			else if(stus[i].stu_id[0] == 'T')	
				 school_temp.total_Score += (stus[i].stu_score * 1.5);
			else
				school_temp.total_Score += stus[i].stu_score;
			schoolMap[strTmp] = school_temp;
		}	
	}
	
	//将map中所有学校都保存在vector schoolVec中，类型为node，node中包括学校姓名、加权总分、参赛人数
	vector<node> schoolVec;
	
	for(it = schoolMap.begin();it != schoolMap.end();it++)
		schoolVec.push_back(node{it->first, (it->second).total_Score, (it->second).peopleNum});
	
	//对schoolVec排序 
	sort(schoolVec.begin(),schoolVec.end(),cmpFun);
	
	int rank = 1,curr_rank = 1;
	cout<<schoolVec.size()<<endl;
	cout<<rank<<" ";
	cout<<schoolVec[0].stu_school<<" "<<schoolVec[0].total_Score<<" "<<schoolVec[0].peopleNum<<endl;
	for(int i = 1;i<schoolVec.size();i++)
	{
		curr_rank++;
		if(schoolVec[i].total_Score == schoolVec[i-1].total_Score){	
			cout<<rank<<" ";
		}else{
			rank = curr_rank;
			cout<<rank<<" ";
		}
		cout<<schoolVec[i].stu_school<<" "<<schoolVec[i].total_Score<<" "<<schoolVec[i].peopleNum<<endl;	
	}		
	delete []stus;	
	return 0;
} 

简短版:

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

struct node{
	string stu_school;
	int total_Score;
	int peopleNum;	
};

int cmpFun(node firstNode,node SecNode){
	if(firstNode.total_Score != SecNode.total_Score)
		return firstNode.total_Score > SecNode.total_Score;
	else if(firstNode.peopleNum != SecNode.peopleNum)
		return firstNode.peopleNum < SecNode.peopleNum;
	else 
		return firstNode.stu_school < SecNode.stu_school;
}

int main(){
	
	int n;
	cin>>n;

	map<string,double> scoreMap;//注意是double 
	map<string,int> NumMap;
	
	for(int i=0;i<n;i++){
		string id,school;
		double score;//注意是double 
        cin>>id;
        cin>>score;
        cin>>school;
        for (int j = 0; j < school.length(); j++)
            school[j] = tolower(school[j]);
        
        if(id[0] == 'B')
        	score /= 1.5;
        else if(id[0] == 'T')
        	score *= 1.5;
        scoreMap[school] += score;
        NumMap[school] += 1;
	}
	
	//将map中所有学校都保存在vector schoolVec中，类型为node，node中包括学校姓名、加权总分、参赛人数
	vector<node> schoolVec;
	map<string,double>::iterator it;
	for(it = scoreMap.begin();it != scoreMap.end();it++)
		schoolVec.push_back(node{it->first, int(scoreMap[it->first]), NumMap[it->first]});
	
	//对schoolVec排序 
	sort(schoolVec.begin(),schoolVec.end(),cmpFun);
	
	int rank = 0, preScore = -1;
    cout<<schoolVec.size()<<endl;
	for (int i = 0; i < schoolVec.size(); i++) {
        if (preScore != schoolVec[i].total_Score) rank = i + 1;
        preScore = schoolVec[i].total_Score;
        cout<<rank<<" ";
        cout << schoolVec[i].stu_school;
        printf(" %d %d\n", schoolVec[i].total_Score, schoolVec[i].peopleNum);
    }	
	
	return 0;
}