PAT 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.

思路简单结构体排序，自写的排序函数cmp()还是好用，用简单的冒泡排序排结构体会时间超限。

代码如下：（注释部分是字写的冒泡排序）

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
struct stu{
    string id;
    int totalrank;
    int group;
    int localrank;
    int point;
}student[30000];
bool cmp(stu A,stu B){
    if(A.point!=B.point)
        return A.point>B.point;
    else return A.id<B.id;
}
int main()
{
    int N,K;
    int sum=0;
    cin>>N;
    int total=0;
    for(int i=0;i<N;i++){
        cin>>K;
        total+=K;
        int j=0;
        for(;j<K;j++){
            cin>>student[sum].id;
            cin>>student[sum].point;
            student[sum].group=i+1;
            sum++;
        }
        sort(student+sum-K,student+sum,cmp);
        /*for(int p=0;p<j;p++)
            for(int q=sum-j;q<sum-1-p;q++){
                if(student[q].point<student[q+1].point){
                    stu stu0=student[q];
                    student[q]=student[q+1];
                    student[q+1]=stu0;
                }
            }*/
        for(int q=sum-j;q<sum;q++)
            if(q!=sum-j&&student[q].point==student[q-1].point)
                student[q].localrank=student[q-1].localrank;
            else
                student[q].localrank=q+1-(sum-j);
    }
    /*for(int i=0;i<sum;i++)
        for(int q=0;q<sum-i;q++){
                if(student[q].point<student[q+1].point){
                    stu stu0=student[q];
                    student[q]=student[q+1];
                    student[q+1]=stu0;
                }
            }*/
    sort(student,student+sum,cmp);
    for(int q=0;q<sum;q++)
            if(q!=0&&student[q].point==student[q-1].point)
                student[q].totalrank=student[q-1].totalrank;
            else
                student[q].totalrank=q+1;
    cout<<total<<endl;
    for(int i=0;i<sum;i++){
        cout<<student[i].id<<' '<<student[i].totalrank<<' '<<student[i].group<<' '<<student[i].localrank<<endl;
    }
    return 0;
}

样例运行结果如下：