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;
    }
    
  • 相关阅读:
    为方便储户,某银行拟开发计算机储蓄系统。储户填写的存款单或取款单由业务员输入系统,如果是存款,系统记录存款人姓名、住址、存款类型、存款日期、利率等信息,并印出存款单给储户;如果是取款,系统计算利息并印出利息清单给储户。 写出问题定义并分析系统的可行性。
    “中文编程”是解决中国程序员编程的有效武器,请问它是个“银弹”吗?
    这是我第一个博客
    jupyter-notebook打不开浏览器的问题
    python购物车程序
    python 登陆小程序
    mysql备份恢复(二)
    mysql备份恢复(一)
    docker实践之创建支持ssh服务的镜像
    基于python的设计模式之创建型模型
  • 原文地址:https://www.cnblogs.com/lingr7/p/9460356.html
Copyright © 2011-2022 走看看