Leetcode 3366. Minimum Array Sum

Given nums and limits op1/op2, you may apply at most op1 operations that replace nums[i] with ceil(nums[i]/2) and at most op2 operations that subtract k from nums[i] (only allowed if nums[i] >= k), with each operation usable at most once per index and both operations allowed on the same index. Find the assignment of these operations that yields the minimum possible sum of the array.