PAT 甲级 1012. The Best Rank
来源:互联网 发布:linux修改文件命令 编辑:程序博客网 时间:2024/05/21 09:48
原题传送门
#include <iostream>#include <map>using namespace std;const int MAX = 2001;map<string, int> query;struct node { // 按相等时的优先顺序 double a; double c; double m; double e;} grade[MAX];int main() { int N, M; cin >> N >> M; string id; for(int i=1; i<=N; ++i) { cin >> id >> grade[i].c >> grade[i].m >> grade[i].e; grade[i].a = (grade[i].c + grade[i].m + grade[i].e) / 3.0; query[id] = i; } for(int i=0; i<M; ++i) { int rank1 = N + 1; char course; cin >> id; if(!query[id]) { cout << "N/A" << endl; continue; } double temp = grade[query[id]].a; //a int count = 1; for(int j=1; j<=N; ++j) { if(grade[j].a > temp) ++count; } if(count < rank1) { rank1 = count; course = 'A'; } temp = grade[query[id]].c; //c count = 1; for(int j=1; j<=N; ++j) { if(grade[j].c > temp) ++count; } if(count < rank1) { rank1 = count; course = 'C'; } temp = grade[query[id]].m; //m count = 1; for(int j=1; j<=N; ++j) { if(grade[j].m > temp) ++count; } if(count < rank1) { rank1 = count; course = 'M'; } temp = grade[query[id]].e; //e count = 1; for(int j=1; j<=N; ++j) { if(grade[j].e > temp) ++count; } if(count < rank1) { rank1 = count; course = 'E'; } printf("%d %c\n", rank1, course); } return 0;}
附原题:
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 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
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 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
- 【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
- 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甲级A1012. The Best Rank (25)
- PAT 1012(甲级) The Best Rank
- pat甲级1012-The Best Rank
- PAT 1012. The Best Rank
- PAT 1012. The Best Rank
- Flex Ethernet (FlexE) 初识
- Selenium基础知识
- Libevent源码分析-----多线程、锁、条件变量(二)
- srand rand RAND_MAX
- Java性能优化的5个技巧
- PAT 甲级 1012. The Best Rank
- 基于现如今流行的SSM(spring springMVC mybatis mysql)框架的hrm人事管理系统后台实例
- 计算机中的“类”的说法
- Windows7 Ubuntu14.04 双系统的卸载及重装
- 我使用过的Linux命令之unrar
- Shape Context算法及其实现
- Libevent源码分析-----TAILQ_QUEUE队列
- 内存系统为什么要分段
- python 的多进程编程