Map in C++ Standard Tem-

plate Library (STL)

Maps are associative containers that store ele-
ments in a mapped fashion. Each element has a
key value and a mapped value. No two mapped val-
ues can have the same key values.
Some basic functions associated with Map:
• begin() – Returns an iterator to the first element
in the map.
• end() – Returns an iterator to the theoretical el-
ement that follows the last element in the map.
• size() – Returns the number of elements in the
map.
• max_size() – Returns the maximum number of
elements that the map can hold.
• empty() – Returns whether the map is empty.
• pair insert(keyvalue, mapvalue) – Adds a new
element to the map.
• erase(iterator position) – Removes the element
at the position pointed by the iterator.
• erase(const g)– Removes the key-value ‘g’ from
the map.
• clear() – Removes all the elements from the
map.
Implementation:
• CPP
// CPP Program to demonstrate the implementation
in Map
#include <iostream>
#include <iterator>
#include <map>
using namespace std;

int main()
{

// empty map container

map<int, int> gquiz1;

// insert elements in random order

gquiz1.insert(pair<int, int>(1, 40));
gquiz1.insert(pair<int, int>(2, 30));
gquiz1.insert(pair<int, int>(3, 60));
gquiz1.insert(pair<int, int>(4, 20));
gquiz1.insert(pair<int, int>(5, 50));
gquiz1.insert(pair<int, int>(6, 50));
gquiz1.insert(pair<int, int>(7, 10));

// printing map gquiz1

map<int, int>::iterator itr;
cout << "\nThe map gquiz1 is : \n";
cout << "\tKEY\tELEMENT\n";
for (itr = gquiz1.begin(); itr != gquiz1.end(); +
+itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
}
cout << endl;

// assigning the elements from gquiz1 to gquiz2

 map<int, int> gquiz2(gquiz1.begin(),
gquiz1.end());

// print all elements of the map gquiz2

cout << "\nThe map gquiz2 after"
<< " assign from gquiz1 is : \n";
cout << "\tKEY\tELEMENT\n";
for (itr = gquiz2.begin(); itr != gquiz2.end(); +
+itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
}
cout << endl;

// remove all elements up to

// element with key=3 in gquiz2
cout << "\ngquiz2 after removal of"
" elements less than key=3 : \n";
cout << "\tKEY\tELEMENT\n";
gquiz2.erase(gquiz2.begin(), gquiz2.find(3));
for (itr = gquiz2.begin(); itr != gquiz2.end(); +
+itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
}
// remove all elements with key = 4
int num;
num = gquiz2.erase(4);
cout << "\ngquiz2.erase(4) : ";
cout << num << " removed \n";
cout << "\tKEY\tELEMENT\n";
 for (itr = gquiz2.begin(); itr != gquiz2.end(); +
+itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
}
cout << endl;
// lower bound and upper bound for map gquiz1
key = 5
cout << "gquiz1.lower_bound(5) : "
<< "\tKEY = ";
cout << gquiz1.lower_bound(5)->first << '\t';
cout << "\tELEMENT = " <<
gquiz1.lower_bound(5)->second
<< endl;
cout << "gquiz1.upper_bound(5) : "
<< "\tKEY = ";
cout << gquiz1.upper_bound(5)->first << '\t';
cout << "\tELEMENT = " <<
gquiz1.upper_bound(5)->second
<< endl;

return 0;
}

Output
The map gquiz1 is :
KEY ELEMENT
1 40
2 30
3 60
4 20
5 50
6 50
7 10
The map gquiz2 after assign from gquiz1 is :
KEY ELEMENT
1 40
2 30
3 60
4 20
5 50
6 50
7 10

gquiz2 after removal of elements less than key=3 :

KEY ELEMENT
3 60
4 20
5 50
6 50
7 10

gquiz2.erase(4) : 1 removed
KEY ELEMENT
3 60
5 50
6 50
7 10

gquiz1.lower_bound(5) : KEY = 5 ELEMENT = 50

gquiz1.upper_bound(5) : KEY = 6 ELEMENT = 50
List of all Functions of Map
Function Definition

map::inser Insert elements with a particular key

t() in the map container.
map:: Returns the number of matches to
count() element with key-value ‘g’ in the
map.

map Returns an iterator of pairs. The pair

equal_rang refers to the bounds of a range that
e() includes all the elements in the
container which have a key
equivalent to k.

map Used to erase elements from the

erase() container.

map rend() Returns a reverse iterator pointing to

the theoretical element right before
the first key-value pair in the
map(which is considered its reverse
end).

map Returns a reverse iterator which

rbegin() points to the last element of the map.

map find() Returns an iterator to the element

with key-value ‘g’ in the map if found,
else returns the iterator to end.

map crbegin() returns a constant reverse

crbegin() iterator referring to the last element
and in the map container. crend() returns
crend() a constant reverse iterator pointing
 to the theoretical element before the
first element in the map.

map cbegin() returns a constant iterator

cbegin() referring to the first element in the
and cend() map container. cend() returns a
constant iterator pointing to the
theoretical element that follows the
last element in the multimap.

map Inserts the key and its element in the

emplace() map container.

map Returns the maximum number of

max_size() elements a map container can hold.

map Returns an iterator to the first

upper_bou element that is equivalent to mapped
nd() value with key-value ‘g’ or definitely
will go after the element with key-
value ‘g’ in the map

map Assigns contents of a container to a

operator= different container, replacing its
current content.

map Returns an iterator to the first

lower_bou element that is equivalent to the
nd() mapped value with key-value ‘g’ or
definitely will not go before the
 element with key-value ‘g’ in the
map.

map Inserts the key and its element in the

emplace_h map container with a given hint.
int()

map Returns the object that determines

value_com how the elements in the map are
p() ordered (‘<‘ by default).

map Returns the object that determines

key_comp( how the elements in the map are
) ordered (‘<‘ by default).

map::size() Returns the number of elements in

the map.

map::empt Returns whether the map is empty

y()

map::begin begin() returns an iterator to the first

() and element in the map. end() returns an
end() iterator to the theoretical element
that follows the last element in the
map

map::oper This operator is used to reference

ator[] the element present at the position
 given inside the operator.

map::clear Removes all the elements from the

() map.

map::at() at() function is used to return the

and reference to the element associated
map::swap with the key k. swap() function is
() used to exchange the contents of
two maps but the maps must be of
the same type, although sizes may
differ.

Multimap in C++ Standard

Template Library (STL)
•
Multimap is similar to a map with the addition that
multiple elements can have the same keys. Also, it
is NOT required that the key-value and mapped
value pair have to be unique in this case. One im-
portant thing to note about multimap is that mul-
timap keeps all the keys in sorted order always.
These properties of multimap make it very much
useful in competitive programming.
Some Basic Functions associated with multimap:
• begin() – Returns an iterator to the first element
in the multimap
 • end() – Returns an iterator to the theoretical el-
ement that follows last element in the mul-
timap
• size() – Returns the number of elements in the
multimap
• max_size() – Returns the maximum number of
elements that the multimap can hold
• empty() – Returns whether the multimap is
empty
• pair<int,int> insert(keyvalue,multimapvalue) –
Adds a new element to the multimap
C++ implementation to illustrate above functions:
• CPP

List of Functions of Multimap

Function Definition

multimap::operat It is used to assign new

or= contents to the container by
replacing the existing
contents.

multimap::crbegi crbegin() returns a constant

n() and reverse iterator referring to the
multimap::crend( last element in the multimap
) container. crend() returns a
 constant reverse iterator
pointing to the theoretical
element before the first
element in the multimap.

multimap::empla Insert the key and its element

ce_hint() in the multimap container with
a given hint.

multimap clear() Removes all the elements from

the multimap.

multimap Returns whether the multimap

empty() is empty.

multimap Returns the maximum number

maxsize() of elements a multimap
container can hold.

multimap Returns the object that

value_comp() determines how the elements
in the multimap are ordered (‘<‘
by default).

multimap rend Returns a reverse iterator

pointing to the theoretical
element preceding to the first
element of the multimap
container.
multimap::cbegin cbegin() returns a constant
() and iterator referring to the first
multimap::cend() element in the multimap
container. cend() returns a
constant iterator pointing to
the theoretical element that
follows the last element in the
multimap.

multimap::swap() Swap the contents of one

multimap with another
multimap of same type and
size.

multimap rbegin Returns an iterator pointing to

the last element of the
container.

multimap size() Returns the number of

elements in the multimap
container.

multimap::empla Inserts the key and its element

ce() in the multimap container.

multimap::begin( begin() returns an iterator

) and referring to the first element in
multimap::end() the multimap container. end()
returns an iterator to the
theoretical element that
 follows the last element in the
multimap.

multimap Returns an iterator to the first

upper_bound() element that is equivalent to
multimapped value with key-
value ‘g’ or definitely will go
after the element with key-
value ‘g’ in the multimap.

multimap::count( Returns the number of matches

) to element with key-value ‘g’ in
the multimap.

multimap::erase( Removes the key value from

) the multimap.

multimap::find() Returns an iterator to the

element with key-value ‘g’ in
the multimap if found, else
returns the iterator to end.

multimap Returns an iterator of pairs.

equal_range() The pair refers to the bounds of
a range that includes all the
elements in the container
which have a key equivalent to
k.

multimap insert() Used to insert elements in the

 multimap container.

multimap Returns an iterator to the first

lower_bound() element that is equivalent to
multimapped value with key-
value ‘g’ or definitely will not
go before the element with
key-value ‘g’ in the multimap.

multimap Returns the object that

key_comp() determines how the elements
in the multimap are ordered (‘<‘
by default).

// CPP Program to demonstrate the implementation of

multimap
#include <iostream>
#include <iterator>
#include <map>
using namespace std;

// Driver Code
int main()
{
multimap<int, int> gquiz1; // empty multimap con-
tainer

// insert elements in random order

gquiz1.insert(pair<int, int>(1, 40));
gquiz1.insert(pair<int, int>(2, 30));
gquiz1.insert(pair<int, int>(3, 60));
 gquiz1.insert(pair<int, int>(6, 50));
gquiz1.insert(pair<int, int>(6, 10));

// printing multimap gquiz1

multimap<int, int>::iterator itr;
cout << "\nThe multimap gquiz1 is : \n";
cout << "\tKEY\tELEMENT\n";
for (itr = gquiz1.begin(); itr != gquiz1.end(); ++itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
}
cout << endl;

// adding elements randomly,

// to check the sorted keys property
gquiz1.insert(pair<int, int>(4, 50));
gquiz1.insert(pair<int, int>(5, 10));

// printing multimap gquiz1 again

cout << "\nThe multimap gquiz1 after adding ex-

tra "
"elements is : \n";
cout << "\tKEY\tELEMENT\n";
for (itr = gquiz1.begin(); itr != gquiz1.end(); ++itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
}
cout << endl;

// assigning the elements from gquiz1 to gquiz2

multimap<int, int> gquiz2(gquiz1.begin(),
gquiz1.end());
 // print all elements of the multimap gquiz2
cout << "\nThe multimap gquiz2 after assign from
"
"gquiz1 is : \n";
cout << "\tKEY\tELEMENT\n";
for (itr = gquiz2.begin(); itr != gquiz2.end(); ++itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
}
cout << endl;

// remove all elements up to

// key with value 3 in gquiz2
cout << "\ngquiz2 after removal of elements less
than "
"key=3 : \n";
cout << "\tKEY\tELEMENT\n";
gquiz2.erase(gquiz2.begin(), gquiz2.find(3));
for (itr = gquiz2.begin(); itr != gquiz2.end(); ++itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
}

// remove all elements with key = 4

int num;
num = gquiz2.erase(4);
cout << "\ngquiz2.erase(4) : ";
cout << num << " removed \n";
cout << "\tKEY\tELEMENT\n";
for (itr = gquiz2.begin(); itr != gquiz2.end(); ++itr) {
cout << '\t' << itr->first << '\t' << itr->second
<< '\n';
 }

cout << endl;

// lower bound and upper bound for multimap

gquiz1 key =
// 5
cout << "gquiz1.lower_bound(5) : "
<< "\tKEY = ";
cout << gquiz1.lower_bound(5)->first << '\t';
cout << "\tELEMENT = " <<
gquiz1.lower_bound(5)->second
<< endl;
cout << "gquiz1.upper_bound(5) : "
<< "\tKEY = ";
cout << gquiz1.upper_bound(5)->first << '\t';
cout << "\tELEMENT = " <<
gquiz1.upper_bound(5)->second
<< endl;

return 0;
}

Output
The multimap gquiz1 is :
KEY ELEMENT
1 40
2 30
3 60
6 50
6 10

The multimap gquiz1 after adding extra elements is :

KEY ELEMENT
 1 40
2 30
3 60
4 50
5 10
6 50
6 10

The multimap gquiz2 after assign from gquiz1 is :

KEY ELEMENT
1 40
2 30
3 60
4 50
5 10
6 50
6 10

gquiz2 after removal of elements less than key=3 :

KEY ELEMENT
3 60
4 50
5 10
6 50
6 10

gquiz2.erase(4) : 1 removed
KEY ELEMENT
3 60
5 10
6 50
6 10

gquiz1.lower_bound(5) : KEY = 5 ELEMENT = 10

gquiz1.upper_bound(5) : KEY = 6 ELEMENT = 50