Changes the priority of the first element of the priority queue, maintaining the heap condition of the queue.
Changes the priority of the first element of 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.