1141 PAT Ranking of Institutions (25point(s)) - C语言 PAT 甲级

最新推荐文章于 2022-01-13 16:07:59 发布

有三只土豆

最新推荐文章于 2022-01-13 16:07:59 发布

阅读量104

点赞数

分类专栏： PAT 甲级文章标签： PAT 甲级 C语言

本文链接：https://blog.csdn.net/huaxuewan/article/details/107203871

版权

PAT 甲级专栏收录该内容

155 篇文章 3 订阅

订阅专栏

1141 PAT Ranking of Institutions (25point(s))

After each PAT, the PAT Center will announce the ranking of institutions based on their students’ performances. Now you are asked to generate the ranklist.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤105), which is the number of testees. Then N lines follow, each gives the information of a testee in the following format:

ID Score School

where ID is a string of 6 characters with the first one representing the test level: B stands for the basic level, A the advanced level and T the top level; Score is an integer in [0, 100]; and School is the institution code which is a string of no more than 6 English letters (case insensitive). Note: it is guaranteed that ID is unique for each testee.

Output Specification:

For each case, first print in a line the total number of institutions. Then output the ranklist of institutions in nondecreasing order of their ranks in the following format:

Rank School TWS Ns

where Rank is the rank (start from 1) of the institution; School is the institution code (all in lower case); ; TWS is the total weighted score which is defined to be the integer part of ScoreB/1.5 + ScoreA + ScoreT*1.5, where ScoreX is the total score of the testees belong to this institution on level X; and Ns is the total number of testees who belong to this institution.

The institutions are ranked according to their TWS. If there is a tie, the institutions are supposed to have the same rank, and they shall be printed in ascending order of Ns. If there is still a tie, they shall be printed in alphabetical order of their codes.

Sample Input:

10
A57908 85 Au
B57908 54 LanX
A37487 60 au
T28374 67 CMU
T32486 24 hypu
A66734 92 cmu
B76378 71 AU
A47780 45 lanx
A72809 100 pku
A03274 45 hypu

Sample Output:

5
1 cmu 192 2
1 au 192 3
3 pku 100 1
4 hypu 81 2
4 lanx 81 2

题目大意：

1085 PAT单位排行 (25point(s))

设计思路：

1085 PAT单位排行（C语言）

从题目上也可看出，又是一道排序题

编译器：C (gcc)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct student{
        char id[7], school[7];
        int score;
};

struct school{
        char name[7];
        int score;
        int num;
};

int cmp_school(const void *a, const void *b)
{
        return strcmp(((struct student*)a)->school, ((struct student*)b)->school);
}

int cmp_score(const void *a, const void *b)
{
        struct school *s1 = (struct school*)a, *s2 = (struct school*)b;
        if (s1->score - s2->score)
                return s2->score - s1->score;
        else if (s1->num - s2->num)
                return s1->num - s2->num;
        else
                return strcmp(s1->name, s2->name);
}

int main()
{
        struct student stus[100001] = {0};
        struct school schs[100001] = {0};
        int n, m = 0, num = 0;
        double sum = 0;
        int i, j;
        char *tmp;

        scanf("%d", &n);
        for (i = 0; i < n; i++) {
                scanf("%s %d %s", stus[i].id, &stus[i].score, stus[i].school);
                for (tmp = stus[i].school; *tmp; tmp++)
                        *tmp = tolower(*tmp);
        }

        qsort(stus, n, sizeof(stus[0]), cmp_school);

        for (i = 0; i < n; i++) {
                switch (stus[i].id[0]) {
                case 'B':
                        sum += stus[i].score / 1.5;
                        break;
                case 'A':
                        sum += stus[i].score;
                        break;
                case 'T':
                        sum += stus[i].score * 1.5;
                        break;
                }
                num++;
                if (i == n - 1 || strcmp(stus[i].school, stus[i + 1].school)) {
                        strcpy(schs[m].name, stus[i].school);
                        schs[m].score = (int)sum;
                        schs[m].num = num;
                        sum = 0;
                        num = 0;
                        m++;
                }
        }

        qsort(schs, m, sizeof(schs[0]), cmp_score);

        printf("%d\n", m);
        for (i = 0, j = 0; i < m; i++) {
                if (i > 0 && schs[i].score < schs[i - 1].score)
                        j = i;
                printf("%d %s %d %d\n", j + 1, schs[i].name,
                                schs[i].score, schs[i].num);
        }

        return 0;
}