zoukankan      html  css  js  c++  java
  • 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  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<cstdio>
    #include<cmath>
    #include<algorithm>
    
    using namespace std;
    
    struct student{
        int id;
        int grade[4];
    }stu[2020];
    
    int Rank[1000000][4] = {0};
    int now;
    char course[4] = {'A','C','M','E'}; //一维数组初始化单引号
    
    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] = stu[i].grade[1] + stu[i].grade[2] + stu[i].grade[3];  //平均数相加可以等价于总数相加
       }
       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
    ");
            else{
               int k = 0;
              for(int j = 0; j < 4; j++){
                if(Rank[query][j] < Rank[query][k])  k = j;
            } 
            
            printf("%d %c
    ",Rank[query][k],course[k]);
            
       }
     }
       
      return 0;
    }
  • 相关阅读:
    摄影测量技术和立体捕捉
    面向 Unity* 软件和虚拟现实的优化:运行时生成内容
    优化 VR 动作类游戏《Space Pirate Trainer*》以便在英特尔® 集成显卡上实现卓越的表现
    VR电竞游戏在英特尔®架构上的用户体验优化
    《物质世界 (Outward)》证明不必压缩制作大型角色扮演游戏的时间
    采用棋盘渲染在英特尔集成显卡上进行实时升级
    数字绘画:快节奏绘画流程
    实时模型 — 超越多边形计算
    舆情文本分析
    python评分卡
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/8570069.html
Copyright © 2011-2022 走看看