Hostel Visit Problem

#1

how to sort the heap?

#2

Hey @RULEREMPIRES
In this Question
Use MAx Heap

#3
#4

all testcases failed

#5

and why we are using max heap instead of min heap?

#6

@RULEREMPIRES
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.

#7

@RULEREMPIRES
you are doing wrong
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) .