I have observed a fact while solving . The complexity of lower bound varies with type of iterator passed to it.

But a more weird fact is

1. the below lower bound takes O(log(n)) time

~~~~~ multiset< ll > set1; //some insert operation on multiset it=set1.lower_bound(val); ~~~~~

the question is Vasiliy's Multiset

here is my submission in which it took O(logn) when i used in above format here

2. the below lower bound works in O(n) time

```
multiset< ll > set1;
//some insert operation on multiset
it=lower_bound(set1.begin(),set1.end(),val);
```

here is my submission in which it took O(n) when i used in above format here

[cut] I dont understand why it was happening like this because both iterators here are same type.

Can someone specify places where all places lower_bound function is of O(logn) complexity

Auto comment: topic has been updated by teja349 (previous revision, new revision, compare).set::lower_bound takes advantage of knowing it's applying this operation on a set and it's properties. Ensuring logN time.

While std::lower_bound only promises logN time if the iterators are random. Set iterator is a not a random one ( as far as I know, I don't mainly use C++), so that explains the time.

This looks good.

Auto comment: topic has been updated by teja349 (previous revision, new revision, compare).Click

i think even u solved it the same way and got TLE right

Method lower_bound of std::multiset class works with internal implementation, it searches for the suitable vertix in self-balanced tree.

And function std::lower_bound uses usual binary search which requires random access iterators for checking element inside range using O(1) time.

Just change it to

This is strictly

O(log(n))