Constructs a priority_queue that is empty or that is a copy of a range of a base container object or of other priority_queue.
Tests if the priority_queue is empty.
Removes the largest element of the priority_queue from the top position.
Adds an element to the priority queue based on the priority of the element from operator<.
Returns the number of elements in the priority_queue.
Returns a const reference to the largest element at the top of the priority_queue.