1012 The Best Rank (25分)

1012 The Best Rank (25分)

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algrbra), and E - English. At the mean time, we encourage students by emphasizing on their best ranks – that is, among the four ranks with respect to the three courses and the average grade, we print the best rank for each student.

For example, The grades of C, M, E and A - Average of 4 students are given as the following:

StudentID  C  M  E  A
310101     98 85 88 90
310102     70 95 88 84
310103     82 87 94 88
310104     91 91 91 91

Then the best ranks for all the students are No.1 since the 1st one has done the best in C Programming Language, while the 2nd one in Mathematics, the 3rd one in English, and the last one in average.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 2 numbers N and M (≤2000), which are the total number of students, and the number of students who would check their ranks, respectively. Then N lines follow, each contains a student ID which is a string of 6 digits, followed by the three integer grades (in the range of [0, 100]) of that student in the order of C, M and E. Then there are M lines, each containing a student ID.

Output Specification:

For each of the M students, print in one line the best rank for him/her, and the symbol of the corresponding rank, separated by a space.

The priorities of the ranking methods are ordered as A > C > M > E. Hence if there are two or more ways for a student to obtain the same best rank, output the one with the highest priority.

If a student is not on the grading list, simply output N/A.

Sample Input:
5 6
310101 98 85 88
310102 70 95 88
310103 82 87 94
310104 91 91 91
310105 85 90 90
310101
310102
310103
310104
310105
999999
Sample Output:
1 C
1 M
1 E
1 A
3 A
N/A
题意:

给定部分学生的三门课程的成绩(C、M、E),计算三门课的平均值(A),现在要对这些学生成绩进行排名,排名规则为每位学生的排名取该学生三门课和这三门课的平均值分别排名的名次中最靠前的排名,然后再给出一部分学生的学号,打印出有排名学生的最好的排名和对应的科目,如果没找到该学生的排名则打印N/A,如果学生stu1最靠前的排名包含了不止一门(比如课程C排名6,M排名5,E排名1,A排名1),则按照A>C>M>E的优先级打印出课程,stu1对应的打印为 1 A

分析:

该题涉及到排序以及查找,用一个结构体分别存储每个学生的学号及对应科目的成绩和平均成绩,所有给出的学生的成绩用vector存储,然后用算法sort对vector各科分别排名,用map存储对应学生的各科的排名,排名按固定科目优先级用vector存储,最后在map里按优先级查找对应学生的最好的排名并输出 。需要注意的点:
1、分数相同的两个同学对应科目排名应该相同;
2、计算平均值时按照题目给出的示例应该是四舍五入后的值应该用int(average+0.5)计算平均值;

题解:
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
struct stu_grade {
	string stu_no;
	int grade_c, grade_m, grade_e, grade_a;
};
bool cmp_c(stu_grade s1, stu_grade s2) {
	return s1.grade_c > s2.grade_c;
}
bool cmp_m(stu_grade s1, stu_grade s2) {
	return s1.grade_m > s2.grade_m;
}
bool cmp_e(stu_grade s1, stu_grade s2) {
	return s1.grade_e > s2.grade_e;
}
bool cmp_a(stu_grade s1, stu_grade s2) {
	return s1.grade_a > s2.grade_a;
}
int main() {
	int n, m; char course[5] = "EMCA";
	string str;
	stu_grade temp;
	vector<stu_grade> v;
	vector<string> v_str;
	map<string, vector<int>> mp;
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> temp.stu_no >> temp.grade_c >> temp.grade_m >> temp.grade_e;
		temp.grade_a=int(float(temp.grade_c+temp.grade_m+temp.grade_e)/3+0.5);
		v.push_back(temp);
	}
	sort(v.begin(), v.end(), cmp_e);
	for (int i = 0; i < v.size(); i++)
		if(!i || v[i-1].grade_e!=v[i].grade_e)
			mp[v[i].stu_no].push_back(i + 1);
		else
			mp[v[i].stu_no].push_back(mp[v[i - 1].stu_no][0]);
	sort(v.begin(), v.end(), cmp_m);
	for (int i = 0; i < v.size(); i++)
		if (!i || v[i - 1].grade_m != v[i].grade_m)
			mp[v[i].stu_no].push_back(i + 1);
		else
			mp[v[i].stu_no].push_back(mp[v[i - 1].stu_no][1]);
	sort(v.begin(), v.end(), cmp_c);
	for (int i = 0; i < v.size(); i++)
		if (!i || v[i - 1].grade_c != v[i].grade_c)
			mp[v[i].stu_no].push_back(i + 1);
		else
			mp[v[i].stu_no].push_back(mp[v[i - 1].stu_no][2]);
	sort(v.begin(), v.end(), cmp_a);
	for (int i = 0; i < v.size(); i++)
		if (!i || v[i - 1].grade_a != v[i].grade_a)
			mp[v[i].stu_no].push_back(i + 1);
		else
			mp[v[i].stu_no].push_back(mp[v[i - 1].stu_no][3]);
	for (int i = 0; i < m; i++) {
		cin>>str;
		v_str.push_back(str);
	}
	for (int i = 0; i < v_str.size(); i++) {
		if (mp.find(v_str[i]) != mp.end()) {
			int rk = 10000; char c;
			for (int j = 0; j < 4; j++) {
				if (mp[v_str[i]][j] <= rk) {
					rk = mp[v_str[i]][j];
					c = course[j];
				}
			}
			printf("%d %c\n", rk, c);
		}
		else
			printf("N/A\n");
	}
	return 0;
}
©️2020 CSDN 皮肤主题: 数字20 设计师:CSDN官方博客 返回首页