Back

The std::priority_queue is a container adapter implementing an ordered queue, i.e. a queue in which the largest element is always on the top and extracted first.

The behaviour is similar to manually managing a heap using heap algorithms, with a more convenient interface. However, with the caveat that the elements can only be copied from the queue, not moved out.

Compiler Explorer link: https://compiler-explorer.com/z/Y5nTozz6d