7-41 PAT排名汇总 (25分)--排序

分别在组内排序，先得出组内的排名。最后总体进行排序，得出总体排名。

#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
using namespace std;
struct node
{
    string num;
    int score;
    int rank[2];
    int place;
};
bool cmp(node a, node b)
{
    if (a.score == b.score)
        return a.num < b.num;
    else
        return a.score > b.score;
}
struct node* a = new struct node[30010];
int* front = new int[30010];
int main()
{
    int N;
    int k = 0;
    int sum = 0;
    cin >> N;
    for (int c = 1; c <= N; c++)
    {
        int M = 0;
        cin >> M;
        sum += M;
        int value = k - 1;
        for (int i = k; i < k + M; i++)
        {
            a[i].place = c;
            cin >> a[i].num;
            scanf("%d",&a[i].score);
            front[i] = i;
        }
        sort(a + k, a + k + M, cmp);
        for (int i = k; i < k + M; i++)
        {
            if (i == 0 || a[i].score != a[i - 1].score)
                a[i].rank[0] = i - value;
            else
            {
                front[i] = front[i - 1];
                int temp = i;
                while (front[temp] != temp)
                {
                    temp = temp - 1;
                }
                a[i].rank[0] = temp - value;
            }
        }
        k = k + M;
    }
    sort(a, a + sum, cmp);
    for (int i = 0; i < sum; i++)
        front[i] = i;
    for (int i = 0; i < sum; i++)
    {
        if (i == 0 || a[i].score != a[i - 1].score)
            a[i].rank[1] = i + 1;
        else
        {
            front[i] = front[i - 1];
            int temp = i;
            while (front[temp] != temp)
            {
                temp = temp - 1;
            }
            a[i].rank[1] = temp + 1;
        }
    }
    cout << sum << endl;
    for (int i = 0; i < sum; i++)
    {
        printf("%s %d %d %d",a[i].num.c_str(),a[i].rank[1], a[i].place, a[i].rank[0]);
        if (i != sum - 1)printf("
");
    }
    delete[]a;
    delete[]front;
    return 0;
}