TLE - used the priority queue method

#1

I have used the priority queue method but to fetch the kth element from the heap. should I pop it k-1 times or there is a better way to do it.
link:

#2

first of all use long long int as square wont fit into integer data value.
secondly no need to push the whole hostel data structure.
watch this->

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.