Hostel Visit Question Heaps

#1

this code is giving TLE for one of the test cases
how to print kth nearest element efficiently
my code -

#2

@avinashmallik2017 you have to solve it using heaps only. https://ide.codingblocks.com/s/201840
For every query of type 1, insert elements until the size of the heap becomes ‘k’.
Then for every query of type 1 after reaching the size k for heap(max-heap) we will check if the current element is smaller than the root of the heap or not. If it is not smaller then we ignore it else we remove the root of the heap and push the new element in the heap. (What this will do is maintain a heap of size k which will contain k nearest coordinates for the dean) .
For every query of type 2 just print the root of the heap.