自定义std::map的排序

std::map的内部排序是按照红黑树进行的，所以，查询时间复杂度为O(log2n).
参考博客：https://www.cnblogs.com/stay-alive/p/8215400.html

#include “pch.h”
#include
#include

class MyType
{
public:
MyType(int vale)
{
value = vale;
}

int GetValue()const
{
    return value;
}

private:
int value;
};

class MyCompare
{
public:
bool operator()(const MyType& lhs, const MyType& rhs)const
{
return lhs.GetValue() > rhs.GetValue();
}
};

void Test()
{
std::map<MyType, std::string, MyCompare> mapValueToName;
mapValueToName[MyType(3)] = “three”;
mapValueToName[MyType(0)] = “