Removes the element with the highest priority from the priority queue, maintaining the heap condition of the queue.
Removes the element with the highest priority from the priority queue, maintaining the heap condition of the queue.This function has a time complexity of O(Log N), with N being the number of elements in the queue.