#include <iostream>
#include <functional>
using namespace std;
#include "set"
//1 集合 元素唯一 自动排序 不能按照[]方式插入元素
//红黑树
void main91()
{
set<int> set1;
set<int, less<int>> set2;
for (int i = 0; i < 5; i++)
{
int tmp = rand();
set1.insert(tmp);
}
set1.insert(100);
set1.insert(100);
set1.insert(100);
for (set<int>::iterator it = set1.begin(); it != set1.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
void main92()
{
set<int, greater<int>> set3;
for (int i = 0; i < 5; i++)
{
int tmp = rand();
set3.insert(tmp);
}
set3.insert(100);
set3.insert(100);
set3.insert(100);
for (set<int>::iterator it = set3.begin(); it != set3.end(); it++)
{
cout << *it << " ";
}
cout << endl;
}
int main()
{
//main91();
main92();
}