std::multiset::upper_bound

From cppreference.com

iterator upper_bound( const Key& key );
const_iterator upper_bound( const Key& key ) const;

Returns an iterator pointing to the first element that is greater than key.

Contents

[edit] Parameters

key - key value to compare the elements to

[edit] Return value

Iterator pointing to the first element that is greater than key. If no such element is found, past-the-end (see end()) iterator is returned.

[edit] Complexity

Logarithmic in the size of the container.

[edit] See also

returns range of elements matching a specific key
(public member function)
returns an iterator to the first element not less than the given value
(public member function)