#282 · #1760 · Minimum Limit of Balls in a Bag(袋子里最少数目的球)

You are given an integer array nums where nums[i] is the number of balls in the i-th bag, and an integer maxOperations. Each operation splits one bag into two bags with positive counts. Return the minimum possible maximum bag size after at most maxOperations operations. Constraints: 1 <= nums.length <= 10^5, 1 <= maxOperations, nums[i] <= 10^9.