[Programmers] LV.2 귤고르기

// LV.2 귤고르기
public static int solution_choice_tangerine(int k, int[] tangerine) {
    int answer = 0;

    Long[] arr = Arrays.stream(tangerine).boxed()
            .collect(Collectors.groupingBy(Function.identity(),Collectors.counting()))
            .values().toArray(Long[]::new);

    Arrays.sort(arr,Comparator.reverseOrder());

    int sum = 0;
    for(Long i : arr){
        sum += i;
        answer++;
        if(k <= sum) break;
    }

    return answer;
}