The priority queue should support the following operations: insert an element into the priority queue with a specified priority, remove the element with the highest priority from the priority queue, ...

// 1) The Traditional Approach of comparisons. // We compare and keep finding the kth element , but that method would require manual checks (say 100th max element would require 100 manual if-else for ...