A1012. The Best Rank (25)
来源:互联网 发布:a 算法八数码 编辑:程序博客网 时间:2024/05/16 17:23
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 <stdio.h>#include <stdlib.h>#include <algorithm>#include <string.h>using namespace std;struct stu{int id;int grade[4];}s[2010];char course[4]={'A','C','M','E'};int rank1[1000000][4]={0};int now;bool cmp(stu a,stu b){return a.grade[now]>b.grade[now];}int main(int argc, char* argv[]){ int n,m;int i,j;scanf("%d%d",&n,&m);for( i=0;i<n;i++){scanf("%d%d%d%d",&s[i].id,&s[i].grade[1],&s[i].grade[2],&s[i].grade[3]);s[i].grade[0]=(s[i].grade[1]+s[i].grade[2]+s[i].grade[3])/3;}for(now=0;now<4;now++){ sort(s,s+n,cmp); rank1[s[0].id][now]=1; for(int i=1;i<n;i++) { if(s[i].grade[now]==s[i-1].grade[now]) { rank1[s[i].id][now]=rank1[s[i-1].id][now]; }else { rank1[s[i].id][now]=i+1; } }}int query;for( i=0;i<m;i++){ scanf("%d",&query); if(rank1[query][0]==0) { printf("N/A\n"); }else{int k=0;for( j=0;j<4;j++){ if(rank1[query][j]<rank1[query][k]) { k=j; }}printf("%d %c\n",rank1[query][k],course[k]);}} system("pause"); return 0;}
- A1012. The Best Rank (25)
- 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)
- PAT-A1012. The Best Rank (25)(排序)
- 排序入门(2)----PAT-A1012 The Best Rank
- The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012 The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- eclipse中maven项目出现JavaBuilder handling CoreException错误
- TFT和IPS屏的区别
- Android Init Language
- PHP微信/支付宝支付接口
- 关于unity出现license error的问题。
- A1012. The Best Rank (25)
- 总结四条对学习Linux系统有帮助的方法
- Spring MVC+jdbcTemplate+MySql实现读写分离
- 2.图像显示
- 如何抓取股票数据
- EventBus介绍与使用
- rails 错误
- 欢迎使用CSDN-markdown编辑器
- float类型 四舍五入