PAT 1137. Final Grading (25) Map应用

最新推荐文章于 2021-01-23 16:06:21 发布

DrawnBreak

最新推荐文章于 2021-01-23 16:06:21 发布

阅读量201

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/a799581229/article/details/79176849

版权

PAT 专栏收录该内容

126 篇文章 0 订阅

订阅专栏

/*************************
题意:
一个普通的表格筛选模拟题
************************/
/***********************
解题思路：
用map记录
先存完
存完之后，在遍历map，去计算各成绩的大小
*************************/
/***********************
笔记：
Map的遍历方法：
for(map<string,Student>::iterator it = Map.begin();it!=Map.end();it++){
	stu = it->second;
*********************/
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<queue>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<stack>
#include<map>
#include<set>
#include<unordered_map>
using namespace std;
#define M 10005
#define INF 0x7ffffff

struct Student{
	int pg,mg,fg,g;
	string name;
};

map<string, Student> Map;
bool cmp(Student a,Student b){
	if(a.g > b.g)
		return true;
	else if(a.g == b.g)
		return a.name < b.name;
	else return false;

}
int getint(double x){
	if(x - int(x) >= 0.5)
		x = x + 1;
	return x;
}
int main(){
	int n, i, k;
	int a,b,c;
	int j, grade;
	char name[25];
	string s;
	Student stu;
	scanf("%d%d%d",&a,&b,&c);
	while(a--){
		cin>>s>>grade;
		stu.fg = stu.mg = stu.g = -1;
		stu.pg = grade;
		stu.name = s;
		Map[s]=stu; 
	}
	while(b--){
		cin>>s>>grade;
		if(Map.find(s) == Map.end()){
			stu.name = s;
			stu.fg = stu.pg = stu.g = -1;
			stu.mg = grade;
		}
		else{
			stu = Map[s];
			stu.mg = grade;
		}
		Map[s] = stu;
	}
	while(c--){
		cin>>s>>grade;
		if(Map.find(s) == Map.end()){
			stu.name = s;
			stu.mg = stu.pg = stu.g = -1;
			stu.fg = grade;
		}
		else{
			stu = Map[s];
			stu.fg = grade;
		}
		Map[s] = stu;	
	}
	int G;
	vector<Student> ans;
	for(map<string,Student>::iterator it = Map.begin();it!=Map.end();it++){
		stu = it->second;
		if(stu.pg < 200)
			continue;
		if(stu.mg == -1 && stu.fg == -1)
			continue;
		else if(stu.mg <= stu.fg)
			stu.g = stu.fg;
		else{
			if(stu.fg == -1)
				stu.g = getint(double(stu.mg)*4/10);
			else stu.g = getint(double(stu.mg)*4/10+double(stu.fg)*6/10);
		}
		if(stu.g >= 60 && stu.g <= 100)
			ans.push_back(stu);
	}
	sort(ans.begin(), ans.end(),cmp);
	for(i=0;i<ans.size();i++){
		stu = ans[i];
		printf("%s %d %d %d %d\n",stu.name.c_str(),stu.pg,stu.mg,stu.fg,stu.g);
	}
	return 0;
}