2064-minimized-maximum-of-products-distributed-to-any-store.js

/**
 * @param {number} n
 * @param {number[]} quantities
 * @return {number}
 */
const minimizedMaximum = function(n, quantities) {
  const m = quantities.length
  let l = 0, r = Math.max(...quantities)
  while(l < r) {
    const mid = l + Math.floor((r - l) / 2)
    if(valid(mid)) r = mid
    else l = mid + 1
  }
  
  return l

  function valid(mid) {
    if(m > n) return false
    let res = 0
    for (let i = 0; i < m; i++) {
      res += Math.ceil(quantities[i] / mid)
    }
    return res <= n
  }
};

// another


/**
 * @param {number} n
 * @param {number[]} quantities
 * @return {number}
 */
var minimizedMaximum = function(n, quantities) {
     let MAX = 0;
    for (let x of quantities) MAX = Math.max(x, MAX);
    let l = 1, r = MAX;
    while (l < r) {
        let mid = Math.floor((l + r) / 2);
        if (valid(quantities, mid) <= n) r = mid;
        else l = mid + 1;
    }
    return l; 
};



  function valid(quantities,  max) {
      let cnt = 0;
      for (let x of quantities) cnt += Math.floor(x / max) + ((x % max) ? 1 : 0);
      return cnt;
  }

// another

/**
 * @param {number} n
 * @param {number[]} quantities
 * @return {number}
 */
const minimizedMaximum = function(n, quantities) {
  let MAX = 0;
  for (let x of quantities) MAX = Math.max(x, MAX);
  let l = 1, r = MAX;
  while (l < r) {
    let mid = Math.floor((l + r) / 2);
    if (valid(quantities, mid, n)) l = mid + 1;
    else r = mid;
  }
  return l; 
};

function valid(quantities,  max, n) {
  let cnt = 0;
  for (let x of quantities) cnt += Math.floor(x / max) + ((x % max) ? 1 : 0);
  return cnt > n;
}