map中是默认升序排序的,当需要用到降序的时候可以用到结构体
如:
# include<iostream>
# include<map>
# include<string>
using namespace std;
class woder
{
public:
int a;
bool operator < (woder const&s)const //此处两个const一定要加,并且一定要重载运算符,map中需要靠这个进行排序
{ //运算符的重载可以改变升序或者降序
return this->a < s.a;
}
};
int main()
{
woder s2;
map<woder,string> s;
s2.a=1;
s.insert(pair<woder,string>(s2,"stduent1"));//此处不能够用make_pair(s2,"student1")赋值,只能使用pair<woder,string>
s2.a++;
s.insert(pair<woder,string>(s2,"stduent2"));
s2.a++;
s.insert(pair<woder,string>(s2,"stduent3"));
map<woder,string>::iterator iter;//容器迭代器的定义
s2.a--;
iter =s.find(s2);//如果要查找,这里直接find(key)就可以
cout<<iter->first.a<<" "<<iter->second<<endl;
/*for(iter=s.begin();iter!=s.end();iter++)
{
cout<<iter->first.a<<" "<<iter->second<<endl;
}*/
return 0;
}