题解 | #成绩排序#

#include <iostream>
#include<algorithm>
#include<string>
using namespace std;
struct student
{
    int score;
    string name;
    int s;
}a[201];
bool cmp1(student a,student b)
{
    if(a.score==b.score) return a.s<b.s;
    return a.score<b.score;
}
bool cmp2(student a,student b)
{
    if(a.score==b.score) return a.s<b.s;
    return a.score>b.score;
}

int main() {
    int n,flag;
    cin>>n>>flag;
    for(int i=0;i<n;i++)
    {
        cin>>a[i].name>>a[i].score;
        a[i].s=i;
    }
    if(flag) sort(a,a+n,cmp1);
    else sort(a,a+n,cmp2);
    for(int i=0;i<n;i++)
    {
        cout<<a[i].name<<" "<<a[i].score<<endl;
    }
    return 0;
}
// 64 位输出请用 printf("%lld")