PAT-A1012-The Best Rank

The BestRank - 题目链接

---

题目描述

 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:
 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

---

解题思路

  根据数据的特点使用结构体来存储学生的分数。
  便于后期查询且编号本身的特点将学生的编号定义为int类型。
  首先读入数据 但是根据排序的优先级 需要先将平均分放到int类型数组的第一位，其次是三门课的分数。
  之后根据数组的顺序对学生全部的数据进行四次排序 每次的结果存放到事先定义的排名数组中。
  在输出的时候由于优先级我们实现确定好了 只有遇到排名小于下一个排名的时候才会进行替换。

 在用到sort函数的时候还是需要自定义cmp函数的。

参考代码

#include <cstdio>
#include <algorithm>

using namespace std;

struct Student {
    int id;
    int grade[4];
} Student[2010];
int now ; //目前存储分数的数组排序的下标
char course[4] = {'A', 'C', 'M', 'E'}; //与排序的优先级对应 最后输出的课程符号
int Rank[1000005][4] ={0}; //二维数组 第二维有一个排序结果

//自定义的比较函数 都是返回比较大的
bool cmp(struct Student a, struct 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", &Student[i].id, &Student[i].grade[1], &Student[i].grade[2], &Student[i].grade[3]);
        Student[i].grade[0] = Student[i].grade[1] + Student[i].grade[2] + Student[i].grade[3];
    }
    for (now = 0; now < 4; ++now) { //对四个分数依次进行排序
        sort(Student, Student + n, cmp);
        Rank[Student[0].id][now] = 1; //第一个值的当前排序结果是 1 
        for (int i = 1; i < n; ++i) {
            if (Student[i].grade[now] == Student[i - 1].grade[now]) { //分数相同即使并列排名
                Rank[Student[i].id][now] = Rank[Student[i - 1].id][now];
            } else {
                Rank[Student[i].id][now] = i + 1; //成绩不同 排名向下移动过
                //这里留下一组数据 1 2 2 4 （此时不存在第三名）
            }
        }
    }
    int query;
    for (int i = 0; i < m; ++i) {
        scanf("%d", &query);
        if (Rank[query][0] == 0) { //如果id存在是不可能出现值是0的
            printf("N/A\n");
        } else {
            int k = 0;
            for (int j = 0; j < 4; ++j) {// 都跟当面最下的排名相比 
                if (Rank[query][j] < Rank[query][k]) {
                    k = j; //小于的情况 才会移动下标
                }
            }
            printf("%d %c\n", Rank[query][k], course[k]);
        }
    }
    return 0;
}