C++ STL set map 学习

由于工作需要，有一批数据，数据包含类型和工资两种属性。需求是找到某个类型的数据，并且是有序的。因此想到了map<int , set<T> >。

直接上代码：

#include <iostream>
#include <set>
#include <map>
using namespace std;
struct StruSalaryInfo
{
int salary;
StruSalaryInfo()
{
salary = 0;
}
};

//为StruSalaryInfo指定作为set元素的排序结构
struct StruSalaryInfoSort
{
public:
bool operator ()(StruSalaryInfo s1, StruSalaryInfo s2) const
{
return s1.salary > s2.salary;
}
};

int main()
{
set<StruSalaryInfo,StruSalaryInfoSort> stest;//自定义结构必须要制定排序方式
map<int,set<StruSalaryInfo,StruSalaryInfoSort> > map_set;//map 嵌套set

StruSalaryInfo s1,s2,s3,s4,s5;
s1.salary=10;
s2.salary=20;
s3.salary=15;
s4.salary=250;
s5.salary=20;
stest.insert(s1);
stest.insert(s2);

set<StruSalaryInfo,StruSalaryInfoSort>::iterator it = stest.begin();
for(;it!=stest.end();it++)
{
cout<<" odds = "<<it->salary<<endl;
}

map_set[10].insert(s1);
map_set[10].insert(s3);
map_set[10].insert(s2);
map_set[12].insert(s2);
map_set[12].insert(s4);
map_set[12].insert(s5);

map<int,set<StruSalaryInfo,StruSalaryInfoSort> >::iterator itMap = map_set.begin();
for(;itMap!=map_set.end();itMap++)
{
cout<<" mapkey = "<<itMap->first<<endl;
set<StruSalaryInfo,StruSalaryInfoSort> setTmp = itMap->second;
set<StruSalaryInfo,StruSalaryInfoSort>::iterator itSet = setTmp.begin();
for(;itSet!=setTmp.end();itSet++)
{
cout<<" itemOdds = "<< itSet->salary<<endl;
}
}
return 0;
}