题解 | #小白鼠排队#

cmp函数：实现自定义sort；sort基于快排，当s1和s2不会发生交换时返回true

struct中定义seq来实现稳定排序

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

struct shu {
    int num;
    string color;
    int seq;
};

bool cmp(shu s1, shu s2) {
    if (s1.num > s2.num) return true;

    if (s1.num == s2.num && s1.seq < s2.seq) return true;

    return false;
}

int main() {

    int n;
    cin >> n;

    vector<shu> vec;
    for (int i = 0; i < n; i++) {
        int num;
        string color;
        cin >> num >> color;
        vec.push_back({num, color, i});
    }

    sort(vec.begin(), vec.end(), cmp);

    for (auto x : vec) {
        cout << x.color << endl;
    }

    return 0;
}