map order by value

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


typedef pair<int, int> PAIR;


bool cmp_by_value(const PAIR& lhs, const PAIR& rhs) {
return lhs.second > rhs.second;
}


struct CmpByValue {
bool operator()(const PAIR& lhs, const PAIR& rhs) {
return lhs.second > rhs.second;
}
};


template<class T>
struct greater1
{
bool operator()(T const &a, T const &b) const { return a > b; }
};


int main(){
//创建按照从大到小的顺序的输出（key）
map<int,int> a;
map<int, int, greater1<int>> a1;
int x,y;
while (cin >> x >>y)
a.insert(pair<int,int>(x,y));
cout << "map:" << endl;
for (pair<int,int>t : a){
cout << t.first <<" "<<t.second<< endl;
}


vector<PAIR> aa(a.begin(),a.end());
//sort(aa.begin(), aa.end(), CmpByValue());
sort(aa.begin(), aa.end(), cmp_by_value);
for (PAIR c : aa){
cout << c.first << " " << c.second << endl;
}
return 0;
}