PAT A 1012 The Best Rank (25 分)

一、思路

设置全局变量tag，实现依据tag排序；

二、代码

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
typedef struct
{
    int ID, score[4], rank[4];
}item;
int tag;
int main()
{
    int N, M;
    char table[5] = "ACME";
    scanf("%d %d", &N, &M);
    vector<item> S(N);
    for( int i = 0; i < N; ++i )
    {
        scanf("%d %d %d %d", &S[i].ID, &S[i].score[1], &S[i].score[2], &S[i].score[3]);
        S[i].score[0] = ( S[i].score[1] + S[i].score[2] + S[i].score[3] ) / 3;
    }
    for( int i = 0; i < 4; ++i )
    {
        tag = i;
        sort( S.begin() , S.end(), []( item a, item b ) { return a.score[tag] > b.score[tag]; } );
        for( int j = 0; j < N; ++j )
        {
            if( !j )
                S[j].rank[i] = 1;
            else if( S[j].score[i] == S[j - 1].score[i] )
                S[j].rank[i] = S[j - 1].rank[i];
            else S[j].rank[i] = j + 1;
        }
    }
    for( int i = 0, ID; i < M; ++i )
    {
        int flag = 0;
        scanf("%d", &ID);
        for( int j = 0, max = 0; j < N; ++j )
            if( S[j].ID == ID )
            {
                flag = 1;
                for( int k = 0; k < 4; ++k )
                    if( S[j].rank[k] < S[j].rank[max] )
                        max = k;
                printf("%d %c\n", S[j].rank[max], table[max]);
            }
        if( !flag )
            printf("N/A\n");
    }
}