1012 The Best Rank (25 分)（测试点 2,3 分析）

最新推荐文章于 2022-01-21 19:42:07 发布
最新推荐文章于 2022-01-21 19:42:07 发布
阅读量686 收藏
点赞数
分类专栏： c++代码 PTA甲级 算法 文章标签： pta 甲级 c++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_45962741/article/details/121397295
版权
算法 同时被 3 个专栏收录
401 篇文章 5 订阅
订阅专栏
c++代码
360 篇文章 3 订阅
订阅专栏
PTA甲级
91 篇文章 1 订阅
订阅专栏

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
结尾无空行

也就只有 天梯或者 pta 出这种 jb 题了，要是面试，不可能考着样的，md。

测试点二不过的原因是，如果存在分数相同，那么排名也应该是相同的，比如 1 1 3 4 5，这个时候就要注意更新的问题了，如果按照我这个方法，结构体中 rank 存的就是最好的结果，那么 如果分数相同，就不能设置为前一个人的排名了，而是得设置 t

相同排名的问题真的搞了我好久

#include<iostream>
#include<string>
#include<algorithm>
#include<bits/stdc++.h>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<deque>
#include<cctype>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<cstring>
using namespace std;
const int N = 2001;
struct Person {
	string id;
	int c;
	int m;
	int e;
	int a;
	int rank = 2002;
	char Rank;
} P[N];
bool cmp1(Person i, Person j) {
	if (i.a == j.a) {
		if (i.c == j.c) {
			if (i.m == j.m) {
				return i.e > j.e;
			}
			return i.m > j.m;
		}
		return i.c > j.c;
	}
	return i.a > j.a;
}
bool cmp2(Person i, Person j) {
	if (i.c == j.c) {
		if (i.m == j.m) {
			return i.e > j.e;
		}
		return i.m > j.m;
	}
	return i.c > j.c;
}
bool cmp3(Person i, Person j) {
	if (i.m == j.m) {
		return i.e > j.e;
	}
	return i.m > j.m;
}
bool cmp4(Person i, Person j) {
	return i.e > j.e;
}
set<string> st;
int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> P[i].id >> P[i].c >> P[i].m >> P[i].e;
		P[i].a = (int)((P[i].c + P[i].m + P[i].e) / 3.0 + 0.5);
		st.insert(P[i].id);
	}
	int t = 1;
	sort(P, P + n, cmp1);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			P[i].rank = t;
			P[i].Rank = 'A';
		} else {
			if (P[i].a != P[i - 1].a) {
				t = i + 1;
			}
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'A';
			}
		}
	}
	t = 1;
	sort(P, P + n, cmp2);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'C';
			}
		} else {
			if (P[i].c != P[i - 1].c) {
				t = i + 1;
			}
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'C';
			}
		}
	}
	t = 1;
	sort(P, P + n, cmp3);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'M';
			}
		} else {
			if (P[i].m != P[i - 1].m) {
				t = i + 1;
			}
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'M';
			}
		}
	}
	t = 1;
	sort(P, P + n, cmp4);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'E';
			}

		} else {
			if (P[i].e != P[i - 1].e) {
				t = i + 1;
			}
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'E';
			}
		}
	}
	while (m--) {
		string s;
		cin >> s;
		if (!st.count(s)) {
			cout << "N/A" << endl;
		} else {
			for (int i = 0; i < n; i++) {
				if (P[i].id == s) {
					cout << P[i].rank << " " << P[i].Rank << endl;
				}
			}
		}
	}

}






#include<iostream>
#include<string>
#include<algorithm>
#include<bits/stdc++.h>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<deque>
#include<cctype>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<cstring>
using namespace std;
const int N = 2001;
struct Person {
	string id;
	int c;
	int m;
	int e;
	int a;
	int rank = 2002;
	char Rank;
} P[N];
bool cmp1(Person i, Person j) {
	if (i.a == j.a) {
		if (i.c == j.c) {
			if (i.m == j.m) {
				return i.e > j.e;
			}
			return i.m > j.m;
		}
		return i.c > j.c;
	}
	return i.a > j.a;
}
bool cmp2(Person i, Person j) {
	if (i.c == j.c) {
		if (i.m == j.m) {
			return i.e > j.e;
		}
		return i.m > j.m;
	}
	return i.c > j.c;
}
bool cmp3(Person i, Person j) {
	if (i.m == j.m) {
		return i.e > j.e;
	}
	return i.m > j.m;
}
bool cmp4(Person i, Person j) {
	return i.e > j.e;
}
set<string> st;
int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> P[i].id >> P[i].c >> P[i].m >> P[i].e;
		P[i].a = (int)((P[i].c + P[i].m + P[i].e) / 3.0 + 0.5);
		st.insert(P[i].id);
	}
	int t = 1;
	sort(P, P + n, cmp1);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'A';
			}
		} else {
			if (P[i].a == P[i - 1].a) {
				if (P[i].rank > t) {
					P[i].rank = t;
					P[i].Rank = 'A';
				}
			} else {
                t = i + 1;
				if (P[i].rank > t) {
					P[i].rank = t;
					P[i].Rank = 'A';
				}
				
			}
		}

	}
	t = 1;
	sort(P, P + n, cmp2);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'C';
			}

		} else {
			if (P[i].c == P[i - 1].c) {
				if (P[i].rank > t) {
					P[i].rank = t;
					P[i].Rank = 'C';
				}
			} else {
				if (P[i].rank > i + 1) {
					P[i].rank = i + 1;
					P[i].Rank = 'C';

				}
				t = i + 1;
			}
		}
	}
	t = 1;
	sort(P, P + n, cmp3);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'M';
			}
		} else {
			if (P[i].m == P[i - 1].m) {
				if (P[i].rank > t) {
					P[i].rank = t;
					P[i].Rank = 'M';
				}
			} else {
				if (P[i].rank > i + 1) {
					P[i].rank = i + 1;
					P[i].Rank = 'M';
				}
				t = i + 1;
			}
		}
	}
	t = 1;
	sort(P, P + n, cmp4);
	for (int i = 0; i < n; i++) {
		if (i == 0) {
			if (P[i].rank > t) {
				P[i].rank = t;
				P[i].Rank = 'E';
			}

		} else {
			if (P[i].e == P[i - 1].e) {
				if (P[i].rank > t) {
					P[i].rank = t;
					P[i].Rank = 'E';
				}
			} else {
				if (P[i].rank > i + 1) {
					P[i].rank = i + 1;
					P[i].Rank = 'E';
				}
				t = i + 1;
			}
		}
	}
	while (m--) {
		string s;
		cin >> s;
		if (!st.count(s)) {
			cout << "N/A" << endl;
		} else {
			for (int i = 0; i < n; i++) {
				if (P[i].id == s) {
					cout << P[i].rank << " " << P[i].Rank << endl;
				}
			}
		}
	}

}
_努力努力再努力_
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
专栏目录
PAT甲级1012 The Best Rank (C++)
小海同学的博客
03-02 377
题意：第一行给出N，K分别是几个人，测试几个人，接下来N行为学生ID，C成绩，M成绩，E成绩。K行测试的学生ID，不存在则输出N/A。 题解：建立学生结构体，包含学生ID、数组grade保存分数，rank数组保存后续的排名。利用结构体的快速排序，将排名赋值给rank。最后用map进行以ID为下标遍历。 详细代码样例： #include <bits/stdc++.h> using namespace std; struct student{ string ID; int grade[4],ra
1012 The Best Rank (25分) 测试点分析 思路分析
weixin_43725617的博客
05-26 1126
文章目录题目题目大意思路分析测试点分析代码总结 题目 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 en
1012 The Best Rank
a1552100455的博客
08-09 322
题目大意 现已知n个考生的3门分数，平均分可以按照这三门算出来。然后分别对这四个分数从高到低排序，这样对每个考生来说有4个排名。k个查询，对于每一个学生id，输出当前id学生的最好的排名和它对应的分数，如果名次相同，按照A>C>M>E的顺序输出,如果当前id不存在，输出N/A. 思路解析 用结构体Stu存放id和grades数组，为了少给自己制造点麻烦，数组里面最好分...
1012 The Best Rank (25 分)（测试点二）
qq_34771124的博客
01-21 5429
1012 The Best Rank (25 分) 题目链接 算法分析 优先队列+数组 分四种情况（C、M、E、A）压入优先队列中 然后把每个科目的排名存在各自的数组中 然后每种情况进行查询即可 测试点 测试点二：成绩相同 我虽然注意到了这一点，但是并没有过 原因在于：对于这样一组数据98 95 96 95 92 排名数据为：1 3 2 3 5 而不是：1 3 2 3 4 改过之后就满分了！ 代码实现 #include<bits/stdc++.h> using namespace std; #
1012 The Best Rank (25)（25 分）
galesaur_wcy
08-09 376
1012 The Best Rank (25)（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 ...
proload-5-2.zip_All the Best_proload
09-22
"Proload-5-2.zip" 是一个名为 "All the Best proload" 的软件的压缩包，其中包含的核心文件是 "proload-5-2.exe"。从标题和描述来看，我们可以推测 "Proload" 是一种软件加载器或启动器，它的版本可能是 5.2。"All ...
GA.rar_GA_The Best Of All
09-24
This Program finds the traveler salesman path with genetic algorithm(all pair connected), its not a best answer. (you can increase the number of generation to improve it).
lssvm.rar_The Best Of All_lssvm
09-24
lssvm All plotting is done with this simple command. It looks for the best way of displaying the result
cu.zip_The Best Of All_python extract
09-21
This is a series of scripts that will help the user extract strings form a file and ... It requires floss and python libraries to be the best function. i hope this is holpful to all of you that use it.
PAT A1012 C语言
weixin_44518800的博客
04-22 134
PAT A1007 C语言题目描述题目解法代码 题目描述 Given a sequence of K integers { N​1, N2, …,NK}. A continuous subsequence is defined to be { Ni, Ni+1, …, N​j} where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For
1012. The Best Rank 解析
sheepyWYY的博客
01-18 870
注意排名的顺序。有并列的同名次。然后下一名要跳位。 比如 88 88 99 70 的排名应该为 2 2 1 4 注意这点应该就能AC了 这个代码敲得好乱。。。。 #include #include #include #include using namespace std; struct Node { int ID; int C; int E; int M; i
1012 The Best Rank （25 分）排序，cmp
1的博客
02-27 1477
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 Li...
1012 The Best Rank（排序）
weixin_44046769的博客
10-17 124
这类题目归结于常用技巧与算法，有很鲜明的套路，重在理解其规则，通常写起来不算太复杂。 题目描述： 题目大致意思： 给出N个学生的学号，C语言，数学和英语课的成绩，再给出M个查询，输出所查询学号学生的最好排名和对应的课程（，当排名相同时，输出排名的优先顺序为平均分>c语言>数学>英语），如果查询的学号不存在，就输出N/A。 大致思路： 利用结构体来存储学生的信息，在录入的时候求出平均值，同样存储在结构体中，然后使用sort函数分别按各种情况进行排序，并且将排序名次也存储在结构体中，在排名
patA 1012The Best rank
QAQ的小耗子的博客
04-22 191
#include &lt;iostream&gt;#include &lt;cstdio&gt;#include &lt;algorithm&gt;#include &lt;cstring&gt;using namespace std;char map[5]={'0','C','M','E','A'};struct student{ char id[15]; int c_score,m_score...
PAT_1012
tzy的专栏
07-17 386
1012. The Best Rank (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue To evaluate the performance of our first yea
1012 The Best Rank （25 分）PAT (Advanced Level) Practice
mlm5678的博客
10-03 167
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 L...
The Best C plus plus Book
最新发布
04-29
There are a lot of great C++ books out there, but some of the most highly recommended ones include: 1. "C++ Primer" by Lippman, Lajoie, and Moo 2. "Effective C++" by Scott Meyers 3. "The C++ Programming Language" by Bjarne Stroustrup 4. "Accelerated C++" by Andrew Koenig and Barbara E. Moo 5. "Modern Effective C++" by Scott Meyers These books cover a broad range of topics and are suitable for both beginners and experienced programmers. Ultimately, the best book for you will depend on your specific needs and learning style.

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

_努力努力再努力_

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付：¥1
获取中
扫码支付

您的余额不足，请更换扫码支付或充值

打赏作者

实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值