C++比较器

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

class test
{
public:
    int id;
    int need;
};

bool cmp(test t1, test t2)
{
    if (t1.need == t2.need)
        return t1.id < t2.id; // need相同按id升序排，id小的优先
    return t1.need > t2.need; // 按need降序排，大的优先
}

int main()
{
    int need[] = {6, 10, 4, 4, 1};
    vector<test> arr(5);
    int i = 1;
    for (auto &x : arr)
    {
        x.id = i;
        x.need = need[i - 1];
        i++;
    }

    for (auto &x : arr)
        cout << x.id << " " << x.need << endl;

    cout << "----------------------------\n";
    sort(arr.begin(), arr.end(), cmp);
    for (auto &x : arr)
        cout << x.id << " " << x.need << endl;
    return 0;
}