How does lower_bound work on a multiset sorted in descending order?

general
1

How does lower_bound work on a multiset sorted in descending order?

multiset<int, greater<int>> s;         // (decreasing order)

For eg → 

8 7 5 5 3               this is the multiset s  which is sorted in decreasing order
s.lower_bound(4)         gives 3 as an answer

How it works?

2

You can check lower_bound definition from cppreference, it depends on the comparator which by default is less<int<. Therefore in this case, lower_bound(x) is actually largest number <= x instead.