Assuming the following snippet of code

set<int>::iterator it = st.begin();
it++;

What's the order of it++. Does it take O(log n)?

Can I ask for fast C++ BigInteger implementation? 

It's not allowed to view a code of a specific handle. We can only view codes that have priority in submission time, judging time, solution size, or execution time.

Is it possible to add this feature?