I have an application (C++) that I think would be well served by an STL priority_queue. The documentation says:
priority_queue
Priority_queue is a cont
top() - O(1) -- as it just returns the element @ front.
top()
push() -
push()
push_into_heap - At most, log(n) comparisons. O(logn)
so push() complexity is -- log(n)