[프로그래머스 Level 1] 과일 장수

function solution(k, m, score) {
    const fruits = new Map();
 
    score.forEach(grade => fruits.set(grade, (fruits.get(grade) || 0) + 1));
 
    let income = 0;
    let pending = 0;
 
    for(let i = k; i > 0; i--){
        if(!fruits.has(i)) continue;
 
        const count = fruits.get(i);
 
        if(pending && count < m - pending){
            pending += count;
 
        } else {
            const box = Math.floor((count + pending) / m);
 
            income += i * m * box;
            pending = (count + pending) % m;
        }
    }
 
    return income;
}

function solution(k, m, score) {
    score.sort((a, b) => a - b).splice(0, score.length % m);
 
    let income = 0;
 
    for(let i = 0; i < score.length; i += m){
        income += score[i] * m;
    }
 
    return income;
}