9 months ago

Bhanupratap Negi • 10

Patna

Apply greedy approach, minimize the largest elements to reduce the difference between the maximum and minimum number, sort the array and insert the elements in a max heap, perform K operations of reducing the top element in the priority queue and re insert it again, meanwhile maintainting the min difference between the largest and smallest number.