1012. The Best Rank (25)-PAT
2013-07-15 11:18
381 查看
1012. The Best Rank (25)
时间限制400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 Algrbra), 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".
推荐指数:※
来源:http://pat.zju.edu.cn/contests/pat-a-practise/1012
#include<iostream> #include<string> using namespace std; #define N 2000 int main() { int n,m,i,j,k,t; int stu [5]; int sear ; char courses[4]={'A','C','M','E'}; cin>>n; cin>>m; for(i=0;i<n;i++){ cin>>stu[i][0]; cin>>stu[i][2]; cin>>stu[i][3]; cin>>stu[i][4]; stu[i][1]=stu[i][2]+stu[i][3]+stu[i][4]; } for(i=0;i<m;i++){ cin>>sear[i]; } for(i=0;i<m;i++){ int high[4]={1,1,1,1}; int score[4],flag=0; for(j=0;j<n;j++){ if(sear[i]==stu[j][0]){ flag=1; score[0]=stu[j][1]; score[1]=stu[j][2]; score[2]=stu[j][3]; score[3]=stu[j][4]; for(k=0;k<n;k++){ if(sear[i]!=stu[k][0]){ if(score[0]<stu[k][1]) high[0]++; if(score[1]<stu[k][2]) high[1]++; if(score[2]<stu[k][3]) high[2]++; if(score[3]<stu[k][4]) high[3]++; } } int highest=N+1,cour; for(t=0;t<=3;t++){ if(high[t]<highest){ highest=high[t]; cour=t; } } cout<<highest<<" "<<courses[cour]<<endl; break; } } if(0==flag) cout<<"N/A"<<endl; } return 0; }
相关文章推荐
- 浙大PAT (Advanced Level) Practise 1012 The Best Rank (25)
- PAT甲 1012. The Best Rank (25)
- 【c++】PAT (Advanced Level)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 (25)
- PAT (Advanced Level) 1012. The Best Rank (25) 最佳排名,结构体排序,哈希查询
- PAT刷题:1012. The Best Rank (25)
- PAT甲级.1012. The Best Rank (25)
- PAT 1012. The Best Rank (25)
- PAT(A) - 1012. The Best Rank (25)
- 【PAT】1012. The Best Rank (25)
- 1012. The Best Rank (25)-PAT甲级真题
- 【PAT】【Advanced Level】1012. The Best Rank (25)
- PAT甲级真题1012. The Best Rank (25)
- PAT题解——1012. The Best Rank (25)
- PAT-A1012. The Best Rank (25)(排序)
- PAT:A1012. The Best Rank (0/25)
- PAT (Advanced) 1012. The Best Rank (25)