You are given a list of ad budgets (integers) and an integer k representing the number of throttle operations available. Each operation selects one active budget and reduces it by a fixed positive integer x. Return the minimum positive integer x such that after at most k operations all budgets are less than or equal to zero.

• If there are no positive budgets, return 1. ...