1. map :: insert( )

    1.1 iterator map_name.insert({key, element})

    1. // C++ program to illustrate
    2. // map::insert({key, element})
    3. #include <bits/stdc++.h>
    4. using namespace std;
    6. int main()
    7. {
    9.     // initialize container
    10.     map<int, int> mp;
    12.     // insert elements in random order
    13.     mp.insert({ 2, 30 });
    14.     mp.insert({ 1, 40 });
    15.     mp.insert({ 3, 60 });
    17.     // does not inserts key 2 with element 20
    18.     mp.insert({ 2, 20 });
    19.     mp.insert({ 5, 50 });
    21.     // prints the elements
    22.     cout << "KEY\tELEMENT\n";
    23.     for (auto & itr : mp) {
    24.         cout << itr.first
    25.              << '\t' << itr.second << '\n';
    26.     }
    27.     return 0;
    28. }
    30. ====================================================================================================
    31. KEY    ELEMENT
    32. 1    40
    33. 2    30
    34. 3    60
    35. 5    50

    1.2 iterator map_name.insert(iterator position, {key, element})

    1. // C++ program to illustrate
    2. // map::insert(iteratorposition, {key, element})
    3. #include <bits/stdc++.h>
    4. using namespace std;
    6. int main()
    7. {
    9.     // initialize container
    10.     map<int, int> mp;
    12.     // insert elements in random order
    13.     mp.insert({ 2, 30 });
    14.     mp.insert({ 1, 40 });
    16.     auto it = mp.find(2);
    18.     // inserts {3, 60} starting the search from
    19.     // position where 2 is present
    20.     mp.insert(it, { 3, 60 });
    22.     // prints the elements
    23.     cout << "KEY\tELEMENT\n";
    24.     for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
    25.         cout << itr->first
    26.             << '\t' << itr->second << '\n';
    27.     }
    28.     return 0;
    29. }
    30. ====================================================================================================  KEY    ELEMENT
    31. 1    40
    32. 2    30
    33. 3    60

    1.3 iterator map_name.insert(iterator position1, iterator position2)

    1. // C++ program to illustrate
    2. // map::insert(iteratorposition1, iteratorposition2)
    3. #include <bits/stdc++.h>
    4. using namespace std;
    6. int main()
    7. {
    9.     // initialize container
    10.     map<int, int> mp, mp1;
    12.     // insert elements in random order
    13.     mp.insert({ 2, 30 });
    14.     mp.insert({ 1, 40 });
    16.     // inserts all elements in range
    17.     // [begin, end) in mp1
    18.     mp1.insert(mp.begin(), mp.end());
    20.     // prints the elements
    21.     cout << "Elements in mp1 are\n";
    22.     cout << "KEY\tELEMENT\n";
    23.     for (auto itr = mp1.begin(); itr != mp1.end(); ++itr) {
    24.         cout << itr->first
    25.             << '\t' << itr->second << '\n';
    26.     }
    27.     return 0;
    28. }
    29. ====================================================================================================
    30. Elements in mp1 are
    31. KEY    ELEMENT
    32. 1    40
    33. 2    30