[eiz]

This is true, however priority_queue is a trivial class implemented on top of the STL heap algorithms (push_heap, pop_heap, make_heap, sort_heap and is_heap), so it's trivial to write your own variant if you need this functionality.