关闭

PAT 1012 The Best Rank

标签: PAT 1012The Best Rank
130人阅读 评论(0) 收藏 举报
分类:

1012. The Best Rank (25)

时间限制
400 ms
内存限制
65536 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 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
#include<iostream>
#include<string>
using namespace std;
struct Student
{
  string id;
  int Cgrade;
  int Mgrade;
  int Egrade;
  int average;
  int cRank;
  int mRank;
  int eRank;
  int aRank;
}stu[2000],sstu[2000];
int Average(const int  c,const int m,const int e)
{
  return (c+m+e)/3;
}
int max(const int cr,const int mr,const int er,const int ar,char &ch)
{
  int temp=ar<(er<(cr<mr?cr:mr)?er:(cr<mr?cr:mr))?ar:(er<(cr<mr?cr:mr)?er:(cr<mr?cr:mr));
  if (temp==ar)
    ch='A';  
  else if(temp==cr)
    ch='C';
  else if (temp==mr)
    ch='M';
  else if (temp==er)
    ch='E';
  return temp;
}
int main()
{
  int num;//输入学生数量
  int snum;//查找学生编号数量
  cin>>num>>snum;
  for(int i=0;i<num;i++)
  {
    cin>>stu[i].id>>stu[i].Cgrade>>stu[i].Mgrade>>stu[i].Egrade;
    stu[i].average=Average(stu[i].Cgrade,stu[i].Mgrade,stu[i].Egrade);
  }
  for(int i=0;i<num;i++)
  {
    stu[i].cRank=1;
    stu[i].mRank=1;
    stu[i].aRank=1;
    stu[i].eRank=1;
    for(int j=0;j<num;j++)
    {    
        if(stu[i].Cgrade<stu[j].Cgrade)
          stu[i].cRank++;  
        if(stu[i].Mgrade<stu[j].Mgrade)
          stu[i].mRank++;
        if(stu[i].Egrade<stu[j].Egrade)
          stu[i].eRank++;
        if(stu[i].average<stu[j].average)
          stu[i].aRank++;
    }
  }
  for(int i=0;i<snum;i++)
    cin>>sstu[i].id;
  for(int i=0;i<snum;i++)
  {
    bool flag=false;
    for(int j=0;j<num;j++)
    {
      if(sstu[i].id==stu[j].id)
      {
        flag=true;
        char ch;
        int temp=max(stu[j].cRank,stu[j].mRank,stu[j].eRank,stu[j].aRank,ch);
        cout<<temp<<" "<<ch<<endl;
        break;
      }
    }
    if(flag==false)
      cout <<"N/A"<<endl;
  }
  return 0;
}


0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

浙大PAT考试1009~1012(1010是个神题。。)

哎,pat1010居然用java写的,不仅用java写的,还加了二分,,,唉,智商捉急啊,主要是pat有的范围也不给清楚。给人造成遐想的空间。。 还是按顺序介绍。。 题目地址:http:/...
  • opm777
  • opm777
  • 2014-06-13 01:22
  • 1697

编程题目: PAT 1012. 数字分类 (20)

1012. 数字分类 (20) 时间限制 50 ms 内存限制 32000 kB 代码长度限制 8000 B 判题...
  • zhangyalin1992
  • zhangyalin1992
  • 2014-07-02 14:30
  • 2883

用JAVA刷OJ万年超时?今天解决它~

前言首先感谢ITEYE@128kj的文章:在POJ中使用StreamTokenizer从命令行获取输入之前刷PAT,这次刷蓝桥杯试题,都出现了相同的解法,用java超时,C通过的情况。所以就进行了一番...
  • xubaifu1997
  • xubaifu1997
  • 2016-10-31 18:10
  • 1438

PAT1012. The Best Rank (25)

题目如下: To evaluate the performance of our first year CS majored students, we consider their grad...
  • wtrnash
  • wtrnash
  • 2017-04-08 13:09
  • 92

【PAT】1012. The Best Rank (25)

题目链接: http://pat.zju.edu.cn/contests/pat-a-practise/1012 题目描述: To evaluate the performance o...
  • realxuejin
  • realxuejin
  • 2013-08-27 11:37
  • 1763

PAT:A1012. The Best Rank (0/25)

To evaluate the performance of our first year CS majored students, we consider their grades of three...
  • u010653518
  • u010653518
  • 2017-02-10 23:00
  • 86

PAT甲级.1012. The Best Rank (25)

题目 To evaluate the performance of our first year CS majored students, we consider their grades of th...
  • R11happy
  • R11happy
  • 2017-02-08 22:17
  • 123

1012. The Best Rank (25)——PAT (Advanced Level) Practise

题目信息: 1012. The Best Rank (25) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 ...
  • xianyun2009
  • xianyun2009
  • 2014-09-25 17:49
  • 655

浙大 PAT Advanced level 1012. The Best Rank

To evaluate the performance of our first year CS majored students, we consider their grades of three...
  • fanxingzju
  • fanxingzju
  • 2016-04-23 21:53
  • 179

PAT (Advanced Level) Practise 1012 The Best Rank (25)

1012. The Best Rank (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B ...
  • jtjy568805874
  • jtjy568805874
  • 2016-03-02 20:31
  • 392
    个人资料
    • 访问:120340次
    • 积分:4554
    • 等级:
    • 排名:第7486名
    • 原创:349篇
    • 转载:0篇
    • 译文:0篇
    • 评论:7条
    最新评论