user182513
Reputation:
C++ set -- number of elements with a key less than x
I have a set<int> and I want to see how many elements in it are less than x. (x is also int)
What should i do?
Upvotes: 12
Views: 12461
Answers (1)
Kerrek SB
Reputation: 477040
Use lower_bound to compute std::distance(s.begin(), s.lower_bound(x)). (If x is a key, this counts the number of elements strictly before x.)
Upvotes: 20
Related Questions
- Count elements lower than a given value in a std::set
- How to use lower_bound/upper_bound to get index number from std::set?
- How to find number lower than key in set? C++
- std::set method to get number of elements lower than a given element?
- std::set<Key, Comparator, Allocator>
- C++ std::set with a custom lower_bound
- Work with sets in C++
- C++ set: counting elements less than a value
- count of elements in a set (not total count)
- how to check whether a set has element(s) in certain range in C++