排序 1025

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxv = 30010;
//因为 n * k >= 30000

int n, k;
int num = 0;

struct Node{
       char id[15];
       int score;
       int local;
       int locRank;
       int finaRank;
}node[maxv];

bool cmp(Node a, Node b){
       if(a.score != b.score) return a.score > b.score;
       else return strcmp(a.id, b.id) < 0;
}

int main()
{

       scanf("%d",&n);
       for(int i = 1; i<= n; i++){
              scanf("%d",&k);
       for(int j = 0; j < k; j++){
              scanf("%s %d", &node[num].id, &node[num].score);
              node[num].local = i;
              num++;
       }
       sort(node + num -k, node + num, cmp);
       node[num - k].locRank = 1;
       for(int j = num - k +1; j < num; j++){
              if(node[j].score == node[j-1].score) {
                     node[j].locRank = node[j-1].locRank;
              }else {
                     node[j].locRank = j + 1 - (num -k);
              }
       }
       }
       sort(node, node + num, cmp);
       //node[0].finaRank = 1;
       int r = 1;
       printf("%d\n",num);
       for(int i = 0; i < num; i++){
              if(i>0 && node[i].score != node[i-1].score){
                     r=i+1;
              }
              printf("%s ", node[i].id);
              printf("%d %d %d\n",r,node[i].local,node[i].locRank);
       }


    //cout << "Hello world!" << endl;
    return 0;
}