Removes the last element from the priority queue, maintaining the heap condition of the queue.
Removes the last element from the priority queue, maintaining the heap condition of the queue.Note: The last element is not guaranteed to be the element with the lowest priority!
This function has a time complexity of O(1).