프로그래머스 귤 고르기(JAVA)

https://school.programmers.co.kr/learn/courses/30/lessons/138476

프로그래머스

 

 

import java.util.*;
class Solution {
    public int solution(int k, int[] tangerine) {
        int answer = 0;
        Map<Integer,Integer> cnt = new HashMap<>();
        Set<Integer> used = new HashSet<>();
        for(int kg : tangerine){
            cnt.merge(kg,1,(v1,v2)->v1+1);
        }
        int boxCnt = 0;
        List<Integer> list = new LinkedList<>();
        for(int key : cnt.keySet()){
            list.add(cnt.get(key));
        }
        Collections.sort(list);
        int sum = 0;
        for(int i = list.size() - 1 ; i >= 0 ; i--){
            int tempCnt = list.get(i);
            sum += tempCnt;
            answer++;
            if(sum >= k){
                break;
            }
        }
        return answer;
    }
}