2226-maximum-candies-allocated-to-k-children.js

/**
 * 2226. Maximum Candies Allocated to K Children
 * https://leetcode.com/problems/maximum-candies-allocated-to-k-children/
 * Difficulty: Medium
 *
 * You are given a 0-indexed integer array candies. Each element in the array denotes a pile of
 * candies of size candies[i]. You can divide each pile into any number of sub piles, but you
 * cannot merge two piles together.
 *
 * You are also given an integer k. You should allocate piles of candies to k children such that
 * each child gets the same number of candies. Each child can be allocated candies from only one
 * pile of candies and some piles of candies may go unused.
 *
 * Return the maximum number of candies each child can get.
 */

/**
 * @param {number[]} candies
 * @param {number} k
 * @return {number}
 */
var maximumCandies = function(candies, k) {
  let left = 0;
  let right = 1e7 + 1;

  while (left + 1 !== right) {
    const middle = Math.floor((left + right) / 2);
    let piles = 0;
    for (const candy of candies) {
      piles += Math.floor(candy / middle);
    }
    if (piles >= k) {
      left = middle;
    } else {
      right = middle;
    }
  }

  return left;
};