题解 | 成绩排序

#include<stdio.h>
#include<algorithm>
#include <vector>

using namespace std;
struct Student{
    int id;
    int score;
};
bool compare_sort(Student lhs,Student rhs){
    if(lhs.score<rhs.score){
        return true;
    }else if(lhs.score==rhs.score&&lhs.id<rhs.id){
        return true;
    }else{
        return false;
    }
}

int main() {
    int n;
    scanf("%d",&n);
    vector<Student> vec(n);
    for(int i=0;i<n;++i){
        scanf("%d%d",&vec[i].id,&vec[i].score);

    }
    sort(vec.begin(), vec.end(), compare_sort);
    for(int i=0;i<n;++i){
        printf("%d %d\n",vec[i].id,vec[i].score);
    }
    return 0;
}