Lower_bound in set (C ++)

Question

I have a set and I want to find the largest number, not more than x in it. (something like lower_bound (x)), how should I do this? Are there any predefined functions?

set<int> myset;
myset.insert(blahblahblah);
int y;
//I want y to be greatest number in myset not greater than x

Answer 1

You can use upper_boundthe following way: upper_bound(x)--. The upper bound gives you the first element to exceed x, so the element you are looking for is the one that was before. You need a special case if upper_boundreturns begin().

Answer 2

In addition to lower_bound, there is also upper_bound C ++ Link

, . begin(), , , .