PAT (Advanced Level) Practise 1012. The Best Rank (25)
来源:互联网 发布:手机视频软件baidu 编辑:程序博客网 时间:2024/05/20 06:40
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 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 <cstdio>#include <cmath>#include <algorithm>using namespace std;struct Student{ int id; int grade[4];}stu[2005];char course[4]={'A','C','M','E'};int Rank[1000000][4]={0};int now;bool cmp(Student a,Student b){ return a.grade[now]>b.grade[now];}int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=0;i<n;i++){ scanf("%d%d%d%d",&stu[i].id,&stu[i].grade[1],&stu[i].grade[2],&stu[i].grade[3]); stu[i].grade[0]=round((stu[i].grade[1]+stu[i].grade[2]+stu[i].grade[3])/3.0); } for(now=0;now<4;now++){ sort(stu,stu+n,cmp); Rank[stu[0].id][now]=1; for(int i=1;i<n;i++){ if(stu[i].grade[now]==stu[i-1].grade[now]) Rank[stu[i].id][now]=Rank[stu[i-1].id][now]; else Rank[stu[i].id][now]=i+1; } } int query; for(int i=0;i<m;i++){ scanf("%d",&query); if(Rank[query][0]==0) printf("N/A\n"); else{ int k=0; for(int j=0;j<4;j++){ if(Rank[query][j]<Rank[query][k]) k=j; } printf("%d %c\n",Rank[query][k],course[k]); } } return 0;}
- PAT (Advanced Level) Practise 1012. The Best Rank (25)
- PAT (Advanced Level) Practise 1012. The Best Rank (25)
- 1012. The Best Rank @ PAT (Advanced Level) Practise
- 浙大PAT (Advanced Level) Practise 1012 The Best Rank (25)
- PAT (Advanced Level) Practise 1012 The Best Rank (25)
- 1012. The Best Rank (25)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1012 The Best Rank
- PAT-PAT (Advanced Level) Practise 1012 The Best Rank (25) (简单模拟)【二星级】
- 【PAT Advanced Level】1012. The Best Rank (25)
- 【c++】PAT (Advanced Level)1012. The Best Rank (25)*
- 【PAT】【Advanced Level】1012. The Best Rank (25)
- PAT (Advanced) 1012. The Best Rank (25)
- PAT (Advanced) 1012. The Best Rank (25)
- [PAT (Advanced Level) ]1012. The Best Rank 解题文档
- 浙大 PAT Advanced level 1012. The Best Rank
- PAT (Advanced Level) 1012. The Best Rank (25) 最佳排名,结构体排序,哈希查询
- PAT(Advanced lecel) 1012. The Best Rank
- Pat(Advanced Level)Practice--1012(The Best Rank)
- Bootstrap CSS3基础排版
- 数据结构与算法分析——c语言描述 练习3.4 答案
- 工作日常--浅谈ES6的let/const
- bit 位图
- 45 Three.js拉伸几何体THREE.TubeGeometry
- PAT (Advanced Level) Practise 1012. The Best Rank (25)
- 7-23 龟兔赛跑(20 分)
- Spring基础之AOP
- 关于数组的补充问题
- nvidia-smi还是nvidia-prime都是显示无效
- zabbix监控检测hbase的region一致性
- 理解RxJava(四)Subject用法及原理分析
- 7-40 Have Fun with Numbers(30 分)
- 20171219