【PAT甲级】1025. PAT Ranking (25)

#include <stdio.h>
#include <iostream>
#include <deque>
#include <algorithm>
#include <string.h>
using namespace std;
typedef struct Testee {
    string num;
    int loca;
    int score;
    int rank;
    int loca_rank;
} Testee;
bool comp(Testee a, Testee b) {
    if (a.score > b.score) return true;
    else if (a.score == b.score && a.num < b.num) return true;
    return false;
}

deque<Testee> q;

int main(int argc, char *argv[]) {
    int n, k;
    int i, j;
    int total_num = 0;
    scanf("%d", &n);
    for (i = 1; i <= n; i++) {
        scanf("%d", &k);
        total_num += k;
        deque<Testee> locq;
        for (j = 0; j < k; j++) {
            Testee t;
            cin >> t.num;
            scanf("%d", &t.score);
            t.loca = i;
            locq.push_back(t);
        }
        sort(locq.begin(), locq.end(), comp);
        locq[0].loca_rank = 1;
        q.push_back(locq[0]);////////
        for (int s = 1; s < k; s++) {
            if (locq[s].score == locq[s - 1].score)
                locq[s].loca_rank = locq[s - 1].loca_rank;
            else locq[s].loca_rank = s + 1;
            q.push_back(locq[s]);
        }
    } 
    sort(q.begin(), q.end(), comp);
    q[0].rank = 1;
    for (i = 1; i < total_num; i++) {
        if (q[i].score == q[i - 1].score)
            q[i].rank = q[i - 1].rank;
        else q[i].rank = i + 1;
    }
    printf("%d\n", total_num);
    for (i = 0; i < total_num; i++) {
        cout << q[i].num;
        printf(" %d %d %d\n", q[i].rank, q[i].loca, q[i].loca_rank);
    }
    return 0;
}