Unlock question doubt

#1


sir i am getting tle in 1 test case please help

#2

this is because you are computing max in every iteration in linear time. you can work with better data structures that can give you next max in logarithmic time… that is you can use heap.
step1. build heap from array
step2. get max element and delete it
step3. repeat step2 k times.

thanks

#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.