What is wrong with my code?

#1
#2

@alankrit.agr99 you should use a MAX heap…you are using a min heap.
also why is the while loop for i<k?? there are q queries…k is not the number of queries.

#3

@alankrit.agr99 Your doubt was reopened.
Is it resolved?

#4

why the max heap? we have to arrange the elements on every insertion in an ascending order.

#5

If you are doing it by the maxheap approach, at any case maxm size of your heap will be k… so complexity will be O(nlogk)
Whereas with min heap…maxm size of your heap will be n…So complexity will be O(n log n)
Refer this Hostel Visit- TLE