PAT 甲级 1012. The Best Rank (25)
来源:互联网 发布:mac的大写键不亮了 编辑:程序博客网 时间:2024/05/21 14:05
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 Algebra), 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 A310101 98 85 88 90310102 70 95 88 84310103 82 87 94 88310104 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
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
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 Input5 6310101 98 85 88310102 70 95 88310103 82 87 94310104 91 91 91310105 85 90 90310101310102310103310104310105999999Sample Output
1 C1 M1 E1 A3 AN/A
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<algorithm>using namespace std;struct node {int id, best;int score[4], rank[4];}stu[2001];int exist[1000000], flag = -1;bool cmp1(node a, node b) {return a.score[flag] > b.score[flag];}int main() {int n, m, id;scanf("%d %d", &n, &m);for (int i = 0; i < n; i++) {scanf("%d%d%d%d", &stu[i].id, &stu[i].score[1], &stu[i].score[2], &stu[i].score[3]);stu[i].score[0] = (stu[i].score[1] + stu[i].score[2] + stu[i].score[3]) / 3.0;}for (flag = 0; flag <= 3; flag++) {sort(stu, stu + n,cmp1);stu[0].rank[flag] = 1;for (int i = 1; i < n; i++) {stu[i].rank[flag] = i + 1;if (stu[i].score[flag] == stu[i - 1].score[flag])stu[i].rank[flag] = stu[i - 1].rank[flag];}}for (int i = 0; i < n; i++) {exist[stu[i].id] = i + 1;stu[i].best = 0;int minn = stu[i].rank[0];for (int j = 1; j <= 3; j++) {if (stu[i].rank[j] < minn) {minn = stu[i].rank[j];stu[i].best = j;}}}char c[5] = { 'A','C','M','E' };for (int i = 0; i < m; i++) {scanf("%d", &id);int temp = exist[id];if (temp) {int best = stu[temp - 1].best;printf("%d %c\n", stu[temp - 1].rank[best], c[best]);}else {printf("N/A\n");}}cin >> m;return 0;}
- 【PAT甲级】1012. The Best Rank (25)
- PAT甲级.1012. The Best Rank (25)
- 1012. The Best Rank (25) PAT甲级
- PAT甲级1012. The Best Rank (25)
- PAT 甲级1012. The Best Rank (25)
- PAT 甲级 1012. The Best Rank (25)
- PAT 甲级 1012. The Best Rank (25)
- PAT 甲级 1012. The Best Rank
- PAT甲级A1012. The Best Rank (25)
- 1012. The Best Rank (25)-PAT甲级真题
- PAT(甲级)1012. The Best Rank (25)
- PAT甲级练习1012. The Best Rank (25)
- PAT甲级真题1012. The Best Rank (25)
- [PAT甲级]1012. The Best Rank (25)(最好排名)
- PAT 1012(甲级) The Best Rank
- pat甲级1012-The Best Rank
- 1012. The Best Rank (25)-PAT
- pat 1012. The Best Rank (25)
- python总结1—引号的使用
- yum安装JDK和Tomcat
- POST 后台404错误
- django--缓存,序列化,信号
- 23种设计模式(10):命令模式
- PAT 甲级 1012. The Best Rank (25)
- GreenDao
- linux安装配置samba服务器
- Linux简答知识点
- Android gridview 自定义的,背景黑色块,黑块问题
- 使用maven创建web项目
- Lambda 表达式(C# 编程指南)
- Python成高收入国家增长最快语言,你动心了吗?
- 第二周项目三