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

 

[문제]

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> hm = new HashMap<>();
        for(int t : tangerine){
            hm.put(t,hm.getOrDefault(t,0)+1);
        }
        List<Integer> list = new ArrayList<>(hm.values());
        Collections.sort(list,(a,b)->b-a);
        int type = 0;
        for(int cnt : list){
            k -= cnt;
            type++;
            if(k<=0) break;
        }
        return type;
    }
}