zoukankan      html  css  js  c++  java
  • A1025 PAT Ranking (25)(25 分)

    A1025 PAT Ranking (25)(25 分)

    Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

    Input Specification:

    Each input file contains one test case. For each case, the first line contains a positive number N (<=100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (<=300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

    Output Specification:

    For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:

    registration_number final_rank location_number local_rank

    The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

    Sample Input:

    2
    5
    1234567890001 95
    1234567890005 100
    1234567890003 95
    1234567890002 77
    1234567890004 85
    4
    1234567890013 65
    1234567890011 25
    1234567890014 100
    1234567890012 85
    

    Sample Output:

    9
    1234567890005 1 1 1
    1234567890014 1 2 1
    1234567890001 3 1 2
    1234567890003 3 1 2
    1234567890004 5 1 4
    1234567890012 5 2 2
    1234567890002 7 1 5
    1234567890013 8 2 3
    1234567890011 9 2 4
    

    思考

    sort第二个参数是尾元素下一个地址,而非尾元素地址。

    cmp函数是会写了

    AC代码

    #include <stdio.h>
    #include <string.h>
    #include <stdlib.h>
    
    struct Student {
        char id[15];
        int score;
        int location_number;
        int local_rank;
    }stu[30010];
    /*目的分数降序,那么第一个参数<第二个参数,返回正值
    =,返回0
    >,返回负值
    成绩相同,准考证号升序*/
    int cmp(const void* a, const void* b) {
    	struct  Student*aa=(Student*)a;
    	struct  Student*bb=(Student*)b;
    //	struct  Student*aa=a;
    //	struct  Student*bb=b;
        if(aa->score != bb->score) return aa->score < bb->score ?1:-1;
        else return strcmp(aa->id, bb->id);
    }
    int main() {
        int n, k, num = 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[num].id, &stu[num].score);
                stu[num].location_number = i;
                num++;
            }
            qsort(stu + num - k, k,sizeof (struct Student), cmp);
            stu[num - k].local_rank = 1;
            for(int j = num - k + 1; j < num; 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 - (num - k);
                }
            }
        }
        printf("%d
    ", num);
        qsort(stu, num ,sizeof (struct Student) ,cmp);
        int r = 1;
        for(int i = 0; i < num; i++) {
            if(i > 0 && stu[i].score != stu[i - 1].score) {
                r = i + 1;
            }
            printf("%s ", stu[i].id);
            printf("%d %d %d
    ", r, stu[i].location_number, stu[i].local_rank);
        }
        return 0;
    }
    
  • 相关阅读:
    delphi中定义了一个过程,是无参的,可是调试中却出现‘too many actual parameters’一般是什么原因
    delphi 实现接口 Unsatisfied forward or external declaration
    安装-[Microsoft] [ODBC驱动程序管理器]找不到数据源名称,未指定默认驱动程序
    delphi中常见错误提示说明
    layui与java后台交互
    delphi中报Left side cannot be assigned to错
    Python快速排序算法
    ubuntu server更改语言为中文
    Ubuntu开启root用户ssh远程密码登录
    错误 Error: electron@13.1.8 postinstall: `node install.js` 的解决
  • 原文地址:https://www.cnblogs.com/lingr7/p/9460356.html
Copyright © 2011-2022 走看看