[프로그래머스 Level 2] 귤 고르기

function solution(k, tangerine) {
    const count = new Map();
 
    tangerine.forEach(t => count.set(t, (count.get(t) || 0) + 1));
 
    let answer = 0;
 
    Array.from(count.keys())
        .sort((a, b) => count.get(b) - count.get(a))
        .some(size => {
            answer++;
            k -= count.get(size);
 
            return k <= 0;
        })
 
    return answer;
}

function solution(k, tangerine) {
    // ✅ 주의! 1 ≤ tangerine의 원소 ≤ 10,000,000
    const max = 10000000;
    const sizes = new Set(tangerine)
    const countBySize = new Array(max).fill(0);
 
    let answer = 0;
 
    tangerine.forEach(t => countBySize[t-1]++);
 
    countBySize.sort((a, b) => b - a)
        .some(count => {
            answer++;
            k -= count;
            return k <= 0;
        });
 
    return answer;
}