function solution(N, stages) {
  let count = {};
  stages.forEach((stage) => (count[stage] = ++count[stage] || 1));

  let total = stages.length;

  let percent = [];

  for (let i = 1; i < N + 1; i++) {
    if (count[i]) {
      percent.push([i, count[i] / total]);
      total -= count[i];
    } else {
      percent.push([i, 0]);
    }
  }

  return percent
    .sort((a, b) => (b[1] === a[1] ? a[0] - b[0] : b[1] - a[1]))
    .map((i) => i[0]);
}

// 실패율
function solution(N, stages) {
  let count = {};
  stages.forEach((stage) => (count[stage] = ++count[stage] || 1));

  let total = stages.length;

  let percent = [];

  for (let i = 1; i < N + 1; i++) {
    if (count[i]) {
      percent.push([i, count[i] / total]);
      total -= count[i];
    } else {
      percent.push([i, 0]);
    }
  }
  const ans = percent.sort((a, b) => parseFloat(b[1] - a[1]).map((i) => i[0]));
  return ans;
}