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.
#include <bits/stdc++.h>
using namespace std;
int main()
{
multimap< int , int > mp;
mp.insert({ 2, 30 });
mp.insert({ 1, 40 });
mp.insert({ 2, 60 });
mp.insert({ 2, 20 });
mp.insert({ 1, 50 });
mp.insert({ 4, 50 });
auto it = mp.upper_bound(2);
cout << "The upper bound of key 2 is " ;
cout << (*it).first << " " << (*it).second << endl;
it = mp.upper_bound(3);
cout << "The upper bound of key 3 is " ;
cout << (*it).first << " " << (*it).second << endl;
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 4 50
The upper bound of key 3 is 4 50
The upper bound of key 5 is 6 0
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!
Last Updated :
25 Jun, 2020
Like Article
Save Article