PAT(A-LEVEL) 1025 PAT Ranking

原创 2017年01月03日 19:30:35

1025 PAT Ranking

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()函数的第三个参数的使用方法。
形如:

bool cmp(Student a, Student b)
{
    if(a.score !=b.score) return a.score > b.score;
    else return strcmp(a.name,b.name) < 0;
}

注意:

  • sort函数头文件为algorithm

#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAX 300000
using namespace std;

struct Student{
    char id[15];
    int score;
    int location;
    int local_rank;
};
Student testee[MAX+10];

bool cmp(Student,Student);

int main() 
{   
    int N,K;
    int count=0;        //total testees number 
    scanf("%d",&N); 
    for(int i=1;i<=N;i++){
        scanf("%d",&K);
        //input id & score of the testees in (i)'s test location
        for(int j=0;j<K;j++){
            scanf("%s%d",testee[count].id,&testee[count].score);
            testee[count].location=i;
            count++;
        }

        //sort the (i)'s test location
        sort(testee+count-K,testee+count,cmp);
        //local ranking
        int rank=1,temp=2;
        testee[count - K].local_rank=rank; 
        for( int j = count - K + 1 ; j < count ; j++ ){
            if ( testee[j].score < testee[j-1].score ) rank=temp;  
            testee[j].local_rank=rank;
            temp++;
        }
    }

    printf("%d\n",count);
    //final ranking
    sort(testee,testee+count,cmp);
    int final_rank=1; 
    printf("%s %d %d %d\n",testee[0].id,final_rank,testee[0].location,testee[0].local_rank);
    for(int i=1;i<count;i++){
        if(testee[i].score<testee[i-1].score) final_rank=i+1;
        printf("%s %d %d %d\n",testee[i].id,final_rank,testee[i].location,testee[i].local_rank);
    }
    return 0;
}

bool cmp(Student x,Student y)
{
    if ( x.score != y.score ) return x.score > y.score;
    else return strcmp(x.id,y.id) < 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

【C++】PAT(advanced level)1025. PAT Ranking (25)*

1025. PAT Ranking (25) 时间限制 200 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 Standard 作者 CH...

Pat(Advanced Level)Practice--1025(PAT Ranking)

Pat1025代码 题目描述: Programming Ability Test (PAT) is organized by the College of Computer Scien...

PAT (Advanced Level) 1025. PAT Ranking (25) 结构体排序

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhe...

1025. PAT Ranking

http://pat.zju.edu.cn/contests/pat-a-practise/1025 灵活掌握容器的使用 #include #include #include ...

1025.PAT Ranking

【题意】         给出PAT几个考场的成绩情况,总结成一个最终成绩榜,给出榜中每个人的ID、总排名(可并列)、考试地点编号、分考场排名(可并列)。 【思路】         分考...

1025. PAT Ranking (25)/YHF/2016/11/17

PAT Ranking (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Prog...

1025. PAT Ranking (25)

考察结构体排序以及合并操作 #include #include #include #include #include #include #include #include using namespa...

1025. PAT Ranking (25)解析

PAT Ranking (25) Programming Ability Test (PAT) is organized by the College of Computer Science and...

PAT Basic Level 1025. 反转链表(25)

【来源】 1025. 翻转链表(25) 【分析】 题目给出一系列链表的节点,要求将链表中每K个节点翻转。最后不到K个元素不反转。 和本题类似的题目有:Advanced Level 中的 1052. L...

PAT (Basic Level) Practise (中文)1025. 反转链表 (25)C语言

1025. 反转链表 (25) 时间限制 300 ms 内存限制 65536 kB 代码长度限制 8000 B 判...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:PAT(A-LEVEL) 1025 PAT Ranking
举报原因:
原因补充:

(最多只允许输入30个字)