set简单用法2 带排序的插入

#include "stdafx.h"
#include <set>
#include <iostream>

using namespace std;

int main(int argc, char* argv[])
{
set<int,greater<int> > m_k;

m_k.insert(2);
m_k.insert(3);
m_k.insert(1);

set<int,greater<int> >::reverse_iterator rindex;
set<int,greater<int> >::iterator index;

for (rindex = m_k.rbegin(); rindex != m_k.rend(); rindex++)
{
cout<<*rindex<<" ";
}
cout<<endl;
for (index = m_k.begin(); index != m_k.end(); index++)
{
cout<<*index<<" ";
}
cout<<endl;

return 0;
}