Inserts the element with the specified priority into the priority queue and maintains the heap condition of the priority queue.
Inserts the element with the specified priority into the priority queue and maintains the heap condition of the priority queue.This function has a time complexity of O(Log N), with N being the number of elements in the queue.