map容器排序

#include <iostream>
#include <string>
#include <map>

using namespace std;

//map容器排序

class myCompare {
public:
	bool operator()(int i1, int i2)const
	{
		return i1 > i2;
	}
};

void printMap(map<int, int, myCompare>&mp)
{
	for (map<int, int, myCompare>::iterator it = mp.begin(); it != mp.end(); it++)
	{
		cout << "key:" << it->first << "  second:" << (*it).second << endl;
	}

	cout << endl;
}


void test01()
{
	//默认构造
	map<int, int, myCompare>mp;

	//插入
	mp.insert(make_pair(1, 11));//推荐这种  
	mp.insert(pair<int, int>(2, 22));
	mp.insert(map<int, int>::value_type(3, 10));
	mp[4] = 60; //不推荐
	printMap(mp);
}

int main()
{
	test01();
	system("pause");
	return 0;
}