https://school.programmers.co.kr/learn/courses/30/lessons/42889
function solution(N, stages) {
let clear= new Array(N);
let failRatio = [];
clear.fill(0)
for (const s of stages) {
if (N >= s) {
clear[s - 1]++;
}
}
let sum = 0;
for (let i = 0; i < clear.length; i++) {
failRatio[i] = {
stage: i + 1,
ratio: clear[i] / (stages.length - sum)
}
sum += clear[i];
}
const answer = failRatio.sort((a, b) => b.ratio - a.ratio).map(x => x.stage);
return answer;
}