Create a max heap using the given array/list elements. for(i = 0 to k-1 times){ swap first element with last element; heapify the array for indices 0 to arrSize-i; } return arr[0]; Space Complexity: O(1) Time Complexity: (k-1)logn where n is number of elements