Minimum Operations to Exceed Threshold Value II

Repeatedly take the two smallest elements x and y and replace them with (2*min(x,y) + max(x,y)); return the minimum number of such greedy merges needed so that every element in nums is at least k. This is a classic priority-queue (min-heap) greedy problem: always combine the two smallest until the smallest value reaches k.