利用sort函数对map容器及vector容器进行排序
#include "stdafx.h"
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int cmp(const pair<int, int>& x, const pair<int, int>& y)//比较函数
{
return x.second < y.second;//默认按照值从小到大排序
//return x.second > y.second;//默认按照值从大到小排序
}
void sortMapByValue(map<int, int>& tMap, vector<pair<int, int> >&tVector)
{
for (map<int, int>::iterator curr = tMap.begin(); curr != tMap.end(); curr++)
tVector.push_back(make_pair(curr->first, curr->second));
sort(tVector.begin(), tVector.end(), cmp);//三个参数时按照第三个参数规则进行排序
//sort(tVector.begin(), tVector.end());//默认按照key值从小到大排序
//sort(tVector.rbegin(), tVector.rend());//默认按照key值从大到小排序
}
//----------- map的key值为string与int类似
//int64_t cmp(const pair<string, int64_t>& x, const pair<string, int64_t>& y)
//{
// return x.second < y.second;//小到大
//}
//void sortMapByValue(map<string, int64_t>& tMap, vector<pair<string, int64_t> >&tVector)
//{
// for (map<string, int64_t>::iterator curr = tMap.begin(); curr != tMap.end(); curr++)
// tVector.push_back(make_pair(curr->first, curr->second));
// sort(tVector.begin(), tVector.end(), cmp);
//}
int main()
{
//------- 对map进行排序 --------------
std::map<int, int> m_win; //需要进行排序的map
m_win.insert(make_pair(5, 2));
m_win.insert(make_pair(2, 4));
m_win.insert(make_pair(3, 2));
m_win.insert(make_pair(4, 3));
m_win.insert(make_pair(1, 1));
vector<pair<int, int>> vec_win; //保存排序完成的结果vector
sortMapByValue(m_win, vec_win); //进行排序
for (auto it : vec_win) { //打印结果
cout << it.first << " : " << it.second << endl;
}
cout <<"----------------"<< endl;
// ---------- 对vector进行排序 -----------
std::vector<int> v_num;
v_num.push_back(1);
v_num.push_back(3);
v_num.push_back(2);
sort(v_num.begin(), v_num.end()); //vector从小到大排序
//sort(v_num.rbegin(), v_num.rend()); //vector从大到小排序
for (auto it : v_num) {
cout << it << endl;
}
//-------------------- map的key值为string进行排序
//std::map<string, int64_t > m_win;
//m_win.insert(make_pair("jjjj", 1));
//m_win.insert(make_pair("ab", 3));
//m_win.insert(make_pair("ba", 2));
//vector<pair<string, int64_t >> vec_win;//保存排序后输家玩家牛值
//sortMapByValue(m_win, vec_win);//进行排序小到大
//for (auto it : vec_win) { //打印结果
// cout << it.first.c_str() << " : " << it.second << endl;
//}
return 0;
}