PAT-1012. The Best Rank (25) - c++编程基础

TOP

PAT-1012. The Best Rank (25)

2014-11-24 01:18:26 【大中小】浏览:2125次

题目描述：

To eva luate 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".

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

分析：

（1）考察对结构体的排序。

（2）注意处理成绩相同的情况，如 1 1 3 4，因为有两个人并列第一，所以第二名实际是排在第三的位置。

代码来自于：http://blog.csdn.net/sunbaigui/article/details/8656832#reply

#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
using namespace std;  
int n;//student  
int m;//query  
typedef struct Node  
{  
    string name;  
    int grade[4];  
    int bestRank;  
    int bestGrade;  
}Node;  
typedef struct SortNode  
{  
    int g, idx, rank;  
    bool operator>(const SortNode& orh)const  
    {  
        return g>orh.g;  
    }  
}SortNode;  
char CharTable[4]={'A','C','M','E'};  
#define INF 0x6FFFFFFF  
int main()  
{  
    //input  
    scanf("%d%d",&n,&m);  
    vector stu(n);//student  
    map stuMap;//for query  
    for(int i = 0; i < n; ++i)  
    {  
        cin>>stu[i].name;  
        scanf("%d%d%d", &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];  
        stu[i].bestRank = INF;  
        stuMap[stu[i].name] = i;  
    }  
    //  
    for(int i = 0; i < 4; ++i)//for every record  
    {  
        vector sortNode(n);  
        for(int j = 0; j < n; ++j)  
        {  
            sortNode[j].g = stu[j].grade[i];  
            sortNode[j].idx = j;  
        }  
        sort(sortNode.begin(), sortNode.end(), greater());  
        //process the same grade case  
        int nowGrade = INF;  
        int nowRank = 0;  
        for(int j = 0; j < n; ++j)  
        {  
            if(sortNode[j].g == nowGrade)  
                sortNode[j].rank = nowRank;  
            else  
            {  
                sortNode[j].rank = j;  
                nowRank = j;  
                nowGrade = sortNode[j].g;  
            }  
        }  
        //then compare to select the best rank  
        for(int j = 0; j < n; ++j)  
        {  
            int idx = sortNode[j].idx;  
            int rank = sortNode[j].rank;  
            if(stu[idx].bestRank > rank)  
                stu[idx].bestRank = rank, stu[idx].bestGrade = i;  
        }  
    }  
  
    //query  
    for(int i = 0; i < m; ++i)  
    {  
        string name;  
        cin>>name;  
        map::iterator it = stuMap.find(name);  
        if(it!=stuMap.end())  
        {  
            int idx = it->second;  
            printf("%d %c\n", stu[idx].bestRank+1, CharTable[stu[idx].bestGrade]);  
        }  
        else printf("N/A\n");  
    }  
    return 0;  
}


【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】

上一篇：PAT-1059. Prime Factors (25)	下一篇：PAT-1051. Pop Sequence (25)