17. 귤 고르기 import java.util.*; class Solution { public int solution(int k, int[] tangerine) { int answer = 0; Map map = new HashMap(); for(int size : tangerine){ map.put(size, map.getOrDefault(size, 0) + 1); } List list = new ArrayList(map.keySet()); list.sort(((o1, o2) -> map.get(o2) - map.get(o1))); for(int i : list){ if(k