TLE on 2nd test Case

[archit1jain (Archit Jain)]

https://ide.codingblocks.com/s/71373

I am getting TLE in my second test case if you can give me some hint

[Anubhav-Aron-1353657628083250 (Anubhav Aron)]

here for updation, you traverse through complete list.

SO your complexity is O(qn)
You need to solve it in O(q log(n))
Hint - use MaxPriority Queue of Size K

[archit1jain (Archit Jain)]

Thank you… Got the answer