title: Traverse existing std priority queue in reverse order
body: <p>I am working on a c++ project using std::priority queue objects. I want at some point of the code to access the priority queue in reverse order(from the bottom to the top), my naive solution is to pop all the element in a new array and store them in reverse order.
  I'm wondering if there's a more optimized away to traverse the priority queue in reverse order?</p>