1025 PAT Ranking (25分)

注意最后输出注册号的时候需要用%013lld的方式输出，否则将导致最后一个样例答案错误。

#include<cstdio>
#include<algorithm>
#include<cstdlib>

struct student {
    long long reg_num;
    int score;
    int rank;
    int loc;
};

bool compare(student a, student b) {
    if (a.score != b.score) return a.score > b.score;
    else return a.reg_num < b.reg_num;
}

int main() {
    student stu[30010];
    int N, K;
    scanf("%d", &N);
    int id = 0, locStart = 0;
    for (int i = 0; i < N; i++) {
        scanf("%d", &K);
        locStart = id;
        for (int j = 0; j < K; j++) {
            scanf("%lld %d", &stu[id].reg_num, &stu[id].score);
            stu[id].loc = i+1;
            id++;
        }
        std::sort(stu+locStart , stu+id, compare);
        int localrank = 1, localranktemp = 1;
        stu[locStart].rank = 1;
        for (int k = locStart+1; k < id; k++) {
            localrank++;
            if (stu[k-1].score != stu[k].score) {
                localranktemp = localrank;
            }
            stu[k].rank = localranktemp;
        }
    }
    std::sort(stu, stu+id, compare);
    int rank = 1, ranktemp = 1;
    printf("%d\n", id);
    printf("%013lld %d %d %d\n", stu[0].reg_num, rank, stu[0].loc, stu[0].rank);
    for(int i = 1; i < id; i++) {
        rank++;
        if (stu[i-1].score != stu[i].score) ranktemp = rank;
        printf("%013lld %d %d %d\n", stu[i].reg_num, ranktemp, stu[i].loc, stu[i].rank);
    }


    return 0;
}