题解 | #成绩排序#

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int Num;
    int op;
    cin >> Num >> op;

    vector<pair<string,int>> temp(Num);
    
    for (int i = 0;i < Num;i++)
    {
        cin >> temp[i].first >> temp[i].second;
    }

    if (op == 0)
    {
        stable_sort(temp.begin(),temp.end(),[](const pair<string,int>& a,const pair<string,int>& b){return a.second > b.second;});
    }
    else if (op == 1) 
    {
        stable_sort(temp.begin(),temp.end(),[](const pair<string,int>& a,const pair<string,int>& b){return a.second < b.second;});
    }

    for (auto it : temp)
    {
        cout << it.first << ' ' << it.second << endl;
    }


}
// 64 位输出请用 printf("%lld")