// CPP program to demonstrate working of set
#include <bits/stdc++.h>
using namespace std;

int main()
{
    set<int> s1;
    s1.insert(2);
    s1.insert(5);
    s1.insert(3);
    s1.insert(6);

    cout << "Elements in set:\n";
    for (auto it : s1)
        cout << it << " "; // Sorted

    return 0;
}

Elements in set:
2 3 5 6

// CPP program to demonstrate working of map
#include <bits/stdc++.h>
using namespace std;

int main()
{
    map<int, int> m;

    m[1] = 2; // Insertion by indexing

    // Direct pair insertion
    m.insert({ 4, 5 });

    // Insertion of pair by make_pair
    m.insert(make_pair(8, 5));

    cout << "Elements in map:\n";
    for (auto it : m)
        cout << "[ " << it.first << ", "\n            << it.second << "]\n"; // Sorted

    return 0;
}

Elements in map:
[ 1, 2]
[ 4, 5]
[ 8, 5]

// CPP program to demonstrate working of Multimap
#include <bits/stdc++.h>
using namespace std;

int main()
{
    multimap<int, int> m;

    m.insert({ 1, 2 });
    m.insert({ 2, 3 });
    m.insert({ 4, 5 });
    m.insert({ 2, 3 });
    m.insert({ 1, 2 });

    cout << "Elements in Multimap:\n";
    for (auto it : m)
        cout << "[ " << it.first << ", "\n            << it.second << "]\n"; // Sorted

    return 0;
}

Elements in Multimap:
[ 1, 2]
[ 1, 2]
[ 2, 3]
[ 2, 3]
[ 4, 5]

// CPP program to demonstrate working of Multiset
#include <bits/stdc++.h>
using namespace std;

int main()
{
    multiset<int> ms;

    ms.insert(1);
    ms.insert(3);
    ms.insert(4);
    ms.insert(2);
    ms.insert(2);

    cout << "Elements in Multiset:\n";
    for (auto it : ms)
        cout << it << " ";

    return 0;
}

Elements in Multiset:
1 2 2 3 4

// CPP program to demonstrate working of Unordered_set
#include <bits/stdc++.h>
using namespace std;

int main()
{
    unordered_set<int> us;

    us.insert(1);
    us.insert(3);
    us.insert(4);
    us.insert(2);
    us.insert(2);

    cout << "Elements in unordered_set:\n";
    for (auto it : us)
        cout << it << " "; // Sorted

    return 0;
}

Elements in unordered_set:
2 4 1 3

// CPP program to demonstrate working of Unordered_map
#include <bits/stdc++.h>
using namespace std;

int main()
{
    unordered_map<int, int> um;

    um[1] = 2;
    um[4] = 5;
    um[2] = 3;
    um[8] = 5;
    um[3] = 6;

    cout << "Elements in unordered_map:\n";
    for (auto it : um)
        cout << "[ " << it.first << ", " << it.second << "]\n";

    return 0;
}

Elements in unordered_map:
[ 3, 6]
[ 2, 3]
[ 8, 5]
[ 1, 2]
[ 4, 5]