题目描述

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.

输入描述

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.

输出描述

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.

输入例子

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

输出例子

1 C
1 M
1 E
1 A
3 A
N/A

我的代码

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std; 
struct Student{
    int id;
    int grade[4];  //0-A 1-C 2-M 3-E 
}stu[30010];

char course[4]={'A','C','M','E'};  //按照优先级排列 
int Rank[10000000][4]={0};  //id及其各科的排名
int now;  //判断是哪一科 

bool cmp(Student a,Student b){
    return a.grade[now]>b.grade[now];
}

int main(){
    int m,n;
    cin>>n;
    cin>>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]);  //A
    }
    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++){
        cin>>query;
        if(Rank[query][0]==0){  //如果学号不存在 
            cout<<"N/A"<<endl;
        }
        else{
            int k=0;
            for(int j=0;j<4;j++){  //遍历找到最优排名 
                if(Rank[query][j]<Rank[query][k]){
                    k=j;
                }
            }
            cout<<Rank[query][k]<<" "<<course[k]<<endl;
        }
    }
    return 0;
}