#include <ext/pb_ds/elem_attribute.hpp> #include <ext/pb_ds/lob_container.hpp>
#define DISTINCT_KEY false
using namespace std;
int main()
{
Set<int> set = {1, 2, 3};
cout << "Set contains: " << set.size() << endl;
if (!DISTINCT_KEY)
{
map<int, int>::iterator mi = set.begin();
while (mi != set.end())
{
cout << *mi << " ";
mi++;
}
}
else
{
map<int, int>::iterator mi = set.find(DISTINCT_KEY);
if (mi != set.
#include <iostream>
#include <iomanip>
#include <ostream>
#include <fstream>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <array>
#include <algorithm>
#include <functional>
#include <cmath>
#include <time.h>
#include <random>
#include <chrono>
#include <cassert>
#include <cstring>
#include <climits>
#include <ext/rope>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>