Node.js) 백준 2792번: 보석 상자

https://www.acmicpc.net/problem/2792

2792번: 보석 상자

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n")
const [N, M] = input.shift().split(' ').map(Number);
const jewelry = input.map(Number)

let min = 0;
let max = Math.max(...jewelry);
let mid;
let answer = Infinity;
while (min <= max) {
  mid = Math.floor((min + max) / 2);
  let res = 0;
  jewelry.forEach(v => {
    res += Math.ceil(v / mid);
  })

  if (res <= N) {
    if (mid < answer) {
      answer = mid
    }
    max = mid - 1;
  } else if (res > N) {
    min = mid + 1;
  }
}

console.log(answer)