1025 PAT Ranking (25)

简单的排序

#include <bits/stdc++.h>
using namespace std;

struct node {
    long long id;
    int score, loc, locrank, rank;
    friend bool operator<(const node &a, const node &b) {
        if (a.score == b.score)
            return a.id < b.id;
        else
            return a.score > b.score;
    }
}a[30010];

int main(int argc, char const *argv[])
{
    int n;
    scanf("%d", &n);
    int cur = 0;
    for (int loci = 1; loci <= n; loci++) {
        int k;
        scanf("%d", &k);
        for (int i = 0; i < k; i++) {
            scanf("%lld%d", &a[cur+i].id, &a[cur+i].score);
            a[cur+i].loc = loci;
        }
        sort(a+cur, a+cur+k);
        for (int i = 0; i < k; i++)
            if (i == 0 || a[cur+i].score != a[cur+i-1].score)
                a[cur+i].locrank = i+1;
            else
                a[cur+i].locrank = a[cur+i-1].locrank;
        cur += k;
    }

    sort(a, a+cur);
    for (int i = 0; i < cur; i++)
        if (i == 0 || a[i].score != a[i-1].score)
            a[i].rank = i+1;
        else
            a[i].rank = a[i-1].rank;

    printf("%d\n", cur);
    for (int i = 0; i < cur; i++)
        printf("%013lld %d %d %d\n", a[i].id, a[i].rank, a[i].loc, a[i].locrank);
    return 0;
}