Set.cpp

#include <bits/stdc++.h>
using namespace std;

// set is an associative container that contains a sorted set of unique objects.
void solve() {
    // --- Initialization ---
    set<int> s1 = {1, 2, 3, 4, 5, 10};
    set<int, greater<int>> s2 = {10, 5, 4, 3, 2, 1};

    // --- Iterators ---
    // begin(), end()
    // rbegin(), rend()

    // --- Capacity ---
    // size(), empty()

    // --- Modifiers ---
    // insert(value), insert(initializer_list), insert(it_first, it_last),
    // insert(pos, value), emplace(args...), emplace_hint(pos, args...)
    // erase(value), erase(pos), erase(pos_first, pos_last)
    // merge(set) -> O(n*log(n))
    // clear()
 
    // --- Lookup ---
    // count(value), contains(value)
    // find(value)
    // lower_bound(value) -> The first element greater than or equal to value.
    // upper_bound(value) -> The first element greater than to value.
    set<int>::iterator lb = s1.lower_bound(5);
    set<int>::iterator ub = s1.upper_bound(5);
    cout << *lb << ' ' << *ub << '\n';

    // --- Hints ---
    // insert(pos, value), emplace_hint(pos, args...), erase(pos)
    // O(1) if the insertion happens in the position just after or before pos, O(log(n)) otherwise.
    // When using a custom class with a set, it's necessary to define a comparator for that class,
    // as the default comparison often relies on the less-than operator (<).

    for (auto x : s1) {
        cout << x << '\n';
    }
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    //cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}