#include<iostream>
#include<ctime>
#include<map>
#include<algorithm>
#include<numeric>
#include<functional>
#include<vector>
using namespace std;
bool CmpByValue(const pair<int, int>&it1, const pair<int, int>&it2)
{
return it1.second > it2.second;
}
void main()
{
map<int, int> Test;
time_t t;
srand((unsigned int)time(&t));
int n = 0;
while (n++<1000)
{
int i = rand() % 1000;
map<int,int>::iterator It = Test.find(i);
It != Test.end() ? Test[i]++ : Test[i] = 1;
}
vector<pair<int, int>> Test_pair_vec(Test.begin(), Test.end()); //排序法
sort(Test_pair_vec.begin(), Test_pair_vec.end(),CmpByValue);
cout << Test_pair_vec[0].first << " " << Test_pair_vec[0].second << endl;
/*map<int, int>::iterator it1 = Test.begin(); //新建map,置换value和key值法
multimap<int, int, greater<int>> T_Swap;
for (; it1 != Test.end(); it1++)
{
T_Swap.insert(multimap<int, int, greater<int>>::value_type(it1->second,it1->first));
}
*/
//cout << (T_Swap.begin()->second) <<" "<< (T_Swap.begin()->first) << endl;
cin.get();
}
map的value值排序
最新推荐文章于 2022-04-10 09:48:54 发布