1025 PAT Ranking（结构体排序）

题目链接

思路：

1. 分考场读入考生数据

2. 对每个考场的考生进行排序，并对local_rank进行赋值

3. 对全部考生进行排序，以变量r记录考生名次

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdio.h>
#include <algorithm>

using namespace std;

struct Student
{
    char id[15];        // 准考证号
    int score;          // 成绩
    int location_num;   // 考场号
    int local_rank;     // 考场内排名
} stu[300010];

bool cmp(Student a, Student b)
{
    if (a.score != b.score)
        return a.score > b.score;       // 按分数从高到低排序
    else
        return strcmp(a.id, b.id) < 0;  // 分数相同，按准考证号从低到高排序
}

int main()
{

    int n, k;
    int countStu = 0;   // 考生总数
    scanf("%d", &n);    // 输入考场数
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &k);    // 考场人数
        for (int j = 0; j < k; j++)
        {
            scanf("%s %d", stu[countStu].id, &stu[countStu].score);
            stu[countStu].location_num = i;
            countStu++;
        }
        sort(stu + countStu - k, stu + countStu, cmp);	// 对单个考场的考生进行排序
        stu[countStu-k].local_rank = 1;
        for (int j = countStu-k+1; j < countStu; j++)
        {
            if (stu[j].score == stu[j-1].score)
            {
                stu[j].local_rank = stu[j-1].local_rank;
            }
            else
            {
                stu[j].local_rank = j + 1 - (countStu - k);
            }
        }
    }
    printf("%d\n", countStu);
    sort(stu, stu+countStu, cmp);
    int r = 1;
    for (int i = 0; i < countStu; i++)
    {
        if (i > 0 && stu[i].score != stu[i-1].score)
        {
            r = i+1;
        }
        printf("%s ", stu[i].id);
        printf("%d %d %d\n", r, stu[i].location_num, stu[i].local_rank);
    }
    return 0;
}