3375. 成绩排序
作者:
lvjj
,
2024-04-03 17:35:19
,
所有人可见
,
阅读 8
#include <bits/stdc++.h>
using namespace std;
struct student{
string name;
int num;
};
bool cmp1(const student &s1,const student &s2){
if(s1.num!=s2.num){
return s1.num<s2.num;
}
return false;
}
bool cmp2(const student &s1,const student &s2){
if(s1.num!=s2.num){
return s1.num>s2.num;
}
return false;
}
int main(){
vector<student> s;
s.resize(1010);
int n,m;
cin>>n;
cin>>m;
for(int i=0;i<n;i++){
cin>>s[i].name>>s[i].num;
}
if(m==1)stable_sort(s.begin(),s.begin()+n,cmp1);
if(m==0)stable_sort(s.begin(),s.begin()+n,cmp2);
for(int i=0;i<n;i++)cout<<s[i].name<<' '<<s[i].num<<endl;
return 0;
}