1760-minimum-limit-of-balls-in-a-bag.js

/**
 * 1760. Minimum Limit of Balls in a Bag
 * https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/
 * Difficulty: Medium
 *
 * You are given an integer array nums where the ith bag contains nums[i] balls. You are also
 * given an integer maxOperations.
 *
 * You can perform the following operation at most maxOperations times:
 * - Take any bag of balls and divide it into two new bags with a positive number of balls.
 *   - For example, a bag of 5 balls can become two new bags of 1 and 4 balls, or two new bags
 *     of 2 and 3 balls.
 *
 * Your penalty is the maximum number of balls in a bag. You want to minimize your penalty after
 * the operations.
 *
 * Return the minimum possible penalty after performing the operations.
 */

/**
 * @param {number[]} nums
 * @param {number} maxOperations
 * @return {number}
 */
var minimumSize = function(nums, maxOperations) {
  let left = 1;
  let right = Math.max(...nums);

  while (left < right) {
    const mid = Math.floor((left + right) / 2);
    let operations = 0;

    for (const num of nums) {
      operations += Math.ceil(num / mid) - 1;
    }

    if (operations <= maxOperations) {
      right = mid;
    } else {
      left = mid + 1;
    }
  }

  return left;
};