Multimap is similar to map with an addition that multiple elements can have same keys. Also, it is NOT required that the key value and mapped value pair has to be unique in this case. One important thing to note about multimap is that multimap keeps all the keys in sorted order always. These properties of multimap makes 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 element that follows last element in the multimap
• 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 

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

List of Functions of Multimap:  

• multimap::operator= in C++ STL– It is used to assign new contents to the container by replacing the existing contents.
• multimap::crbegin() and multimap::crend() in C++ STL– crbegin() returns a constant reverse iterator referring to the 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::emplace_hint() in C++ STL– Inserts the key and its element in the multimap container with a given hint.
• multimap clear() function in C++ STL– Removes all the elements from the multimap.
• multimap empty() function in C++ STL– Returns whether the multimap is empty.
• multimap maxsize() in C++ STL– Returns the maximum number of elements a multimap container can hold.
• multimap value_comp() function in C++ STL– Returns the object that determines how the elements in the multimap are ordered (‘<‘ by default)
• multimap rend in C++ STL– Returns a reverse iterator pointing to the theoretical element preceding to the first element of the multimap container.
• multimap::cbegin() and multimap::cend() in C++ STL– cbegin() returns a constant iterator referring to the first element in the multimap container. cend() returns a constant iterator pointing to the theoretical element that follows last element in the multimap.
• multimap::swap() in C++ STL– Swap the contents of one multimap with another multimap of same type and size.
• multimap rbegin in C++ STL– Returns an iterator pointing to the last element of the container.
• multimap size() function in C++ STL– Returns the number of elements in the multimap container.
• multimap::emplace() in C++ STL– Inserts the key and its element in the multimap container.
• multimap::begin() and multimap::end() in C++ STL– begin() returns an iterator referring to the first element in the multimap container. end() returns an iterator to the theoretical element that follows last element in the multimap.
• multimap upper_bound() function in C++ STL– Returns an iterator to the first 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() in C++ STL– Returns the number of matches to element with key value ‘g’ in the multimap.
• multimap::erase() in C++ STL– Removes the key value from the multimap.
• multimap::find() in C++ STL– Returns an iterator to the element with key value ‘g’ in the multimap if found, else returns the iterator to end.
• multimap equal_range() in C++ STL– Returns an iterator of pairs. 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() in C++ STL– Used to insert elements in the multimap container.
• multimap lower_bound() function in C++ STL– Returns an iterator to the first 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 key_comp() in C++ STL– Returns the object that determines how the elements in the multimap are ordered (‘<‘ by default).

Recent articles on Multimap
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above 

Attention reader! Don’t stop learning now. Get hold of all the important C++ Foundation and STL concepts with the C++ Foundation and STL courses at a student-friendly price and become industry ready.