참치코더의 꿈 메모장

12345678910111213141516171819function solution(k, tangerine) { var answer = 0; const freqMap = new Map(); for (const item of tangerine){ freqMap.set(item, (freqMap.get(item) || 0) + 1) } // 배열 변환 후 내림차순 정렬 [2,2,2,1,1] const counts = [...freqMap.values()].sort((a, b) => b - a); let remaining = k; for(const count of counts){ remaining -= count; answ..