# multimap upper_bound() function in C++ STL

The multimap::upper_bound(k) is a built-in function in C++ STL which returns an iterator pointing to the immediate next element which is just greater than k. If the key passed in the parameter exceeds the maximum key in the container, then the iterator returned points to key+1 and element=0.

Syntax:

multimap_name.upper_bound(key)

Parameters: This function accepts a single mandatory parameter key which specifies the element whose lower_bound is returned.

Return Value: The function returns an iterator pointing to the immediate next element which is just greater than k. If the key passed in the parameter exceeds the maximum key in the container, then the iterator returned points to key+1 and element=0.

 // C++ function for illustration // multimap::upper_bound() function #include using namespace std;    int main() {        // initialize container     multimap mp;        // insert elements in random order     mp.insert({ 2, 30 });     mp.insert({ 1, 40 });     mp.insert({ 2, 60 });     mp.insert({ 2, 20 });     mp.insert({ 1, 50 });     mp.insert({ 4, 50 });        // when 2 is present     auto it = mp.upper_bound(2);     cout << "The upper bound of key 2 is ";     cout << (*it).first << " " << (*it).second << endl;        // when 3 is not present     it = mp.upper_bound(3);     cout << "The upper bound of key 3 is ";     cout << (*it).first << " " << (*it).second << endl;        // when 5 is exceeds the maximum key     it = mp.upper_bound(5);     cout << "The upper bound of key 5 is ";     cout << (*it).first << " " << (*it).second;     return 0; }

Output:

The upper bound of key 2 is 1 50
The upper bound of key 3 is 4 50
The upper bound of key 5 is 6 0

GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Improved By : Vik_24

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.