代码如下:
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef pair<string,int> FRE;
bool comless(const FRE &A,const FRE &B) {
return A.second < B.second;
}
bool comgreater(const FRE &A,const FRE &B) {
return A.second > B.second;
}
int main(int argc, char const *argv[])
{
// 按key递增
map<string,int> key_incre;
key_incre["bb"] = 1;
key_incre["aa"] = 2;
key_incre["cc"] = 3;
map<string,int>::iterator iter;
for (iter = key_incre.begin();iter != key_incre.end();iter++) {
cout << iter->first << " " << iter->second << endl;
}
cout << endl;
// 按key递减
map<string,int,greater<string> > key_decre;
key_decre["bb"] = 1;
key_decre["aa"] = 2;
key_decre["cc"] = 3;
for (iter = key_decre.begin();iter != key_decre.end();iter++) {
cout << iter->first << " " << iter->second << endl;
}
cout << endl;
// 按value递增
vector<FRE> vec_incre(key_decre.begin(),key_decre.end());
sort(vec_incre.begin(),vec_incre.end(),comless);
vector<FRE>::iterator it;
for (it = vec_incre.begin();it != vec_incre.end();it++) {
cout << it->first << " " << it->second << endl;
}
cout << endl;
// 按value递减
vector<FRE> vec_decre(key_decre.begin(),key_decre.end());
sort(vec_decre.begin(),vec_decre.end(),comgreater);
for (it = vec_decre.begin();it != vec_decre.end();it++) {
cout << it->first << " " << it->second << endl;
}
cout << endl;
return 0;
}
输出如下:
代码解释:
- 正常情况下,map的内部顺序为按照key值递增。
- 在定义map的时候,第三个参数设置为greater时(T为key的类型),map的内部顺序为按key的递减排序。
- 若要按照value进行排序,只能首先将map转化为vector,然后再使用sort,同时自定义sort的第三个参数,compare函数。