1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
function solution(players, m, k) {
  let result = 0;
  const queue = [];

  players.forEach((player, index) => {
    while (queue.length && queue[0] + k === index) queue.shift();

    const needServer = Math.floor(player / m);

    while (queue.length < needServer) {
      queue.push(index);
      result++;
    }
  });

  return result;
}