PAT A1012. The Best Rank (25)
来源:互联网 发布:java中如果不用static 编辑:程序博客网 时间:2024/05/16 00:51
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 <algorithm>#include <cmath>#include <cstring>#define Max 3000using namespace std;int R[10000001][5]={0},x,y;int q;struct student {int id;int s[4];}S[Max];bool cmp(student a,student b){return a.s[q]>b.s[q];}int main(){int n,m;char K[4]={'A','C','M','E'};scanf("%d %d",&n,&m);for(int i=0;i<n;i++){scanf("%d%d%d%d",&S[i].id,&S[i].s[1],&S[i].s[2],&S[i].s[3]);S[i].s[0]=S[i].s[1]+S[i].s[2]+S[i].s[3];}//for(int i=0;i<10000001;i++) R[i][0]=0;for(q=0;q<4;q++){sort(S,S+n,cmp);R[S[0].id][q]=1;for(int i=1;i<n;i++){if(S[i].s[q]==S[i-1].s[q])R[S[i].id][q]=R[S[i-1].id][q];else R[S[i].id][q]=i+1;}}for(int i=0;i<m;i++){int sid;scanf("%d",&sid);if(R[sid][0]==0) printf("N/A\n");else {x=5;for(int j=0;j<4;j++){if(R[sid][j]<x){x=R[sid][j];y=j;}}printf("%d %c\n",x,K[y]);}}system("pause");return 0;}
- PAT甲级A1012. The Best Rank (25)
- PAT---A1012. The Best Rank (25)
- PAT A1012. The Best Rank (25)
- PAT:A1012. The Best Rank (0/25)
- PAT A1012. The Best Rank (25)
- A1012. The Best Rank (25)
- PAT-A1012. The Best Rank (25)(排序)
- 排序入门(2)----PAT-A1012 The Best Rank
- PAT A1012 The Best Rank 极度依靠书的思路再自己做的。。。不过ac一次过了
- 1012. The Best Rank (25)-PAT
- pat 1012. The Best Rank (25)
- 【PAT】1012. The Best Rank (25)
- PAT (Advanced) 1012. The Best Rank (25)
- PAT 1012. The Best Rank (25)
- PAT A 1012. The Best Rank (25)
- PAT 1012. The Best Rank (25)
- PAT 1012. The Best Rank (25)
- PAT 1012 The Best Rank (25)
- 阿里云ECS服务器在Mac下远程配置ftp服务器
- 机器学习(一)win10+python3.5安装numpy+MKL、scipy、matplotlib、scikit-learn
- 小虎OS(XiaoHuOS)打造自己的RTOS,基于stc12c5a60s2(51内核)的可剥夺多任务管理操作系统
- [Android新手学习笔记06]-活动Activity生命周期
- 一个Python程序员的进化(转)
- PAT A1012. The Best Rank (25)
- [Android新手学习笔记07]-AndroidMainfest配置
- Swift3.0从入门到放弃(一)
- Python中print语句的重定向
- 13.4
- Android实用开源—BGA系列
- SpringBoot 入门教程:集成mybatis,redis
- QListWidget上item点击出现白色小框的问题
- Google hosts更新