map按照值排序

#include<bits/stdc++.h>

using namespace std;

map<int,int/*,greater<int>*/>mp;
//Tip: map按照key从大到小排序 map<int,int,greater<int>> mp;

bool cmp(const pair<int,int> &a, const pair<int,int> &b){
    return a.second > b.second;
}

struct cmp2{
    bool operator () (const pair<int,int> &a, const pair<int,int> &b) const{
        return a.second > b.second;
    }
};

int main(){
    
    for(int i=1; i<=10; i++){
        mp[i] = 10 -i;
    }
    
    vector<pair<int,int>> v(mp.begin(),mp.end());
    sort(v.begin(),v.end(),cmp);
    //sort(v.begin(),v.end(),cmp2());
    for(int i=0; i<v.size(); i++){
        cout << v[i].first << " " << v[i].second << endl;
    }
    return 0;
}