AcWing 3376. 成绩排序2
原题链接
简单
作者:
小小小陈
,
2022-02-24 11:31:57
,
所有人可见
,
阅读 138
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110;
struct Student{
int score, number;
}stu[N];
bool cmp(Student a, Student b) {
if(a.score == b.score) return a.number < b.number;
else return a.score < b.score;
}
int main() {
int n;
cin>>n;
for(int i = 0; i < n; i++) cin>>stu[i].number>>stu[i].score;
sort(stu, stu + n, cmp);
for(int i = 0; i < n; i++) cout<<stu[i].number<<" "<<stu[i].score<<endl;
return 0;
}