과일 장수

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

import java.util.*;

class Solution {
    public int solution(int k, int m, int[] score) {
        int answer = 0;
        
        Arrays.sort(score);
    
        for(int i=score.length-m; i>=0; i-=m)
        {
            answer+=score[i]*m;
        }
        return answer;
    }
}

import java.util.*;

class Solution {
    public int solution(int k, int m, int[] score) {
        int answer = 0;
        
        int div = score.length/m;
        var list = new ArrayList<Integer>();
        for(int i=0; i<score.length; i++)
        {
            list.add(score[i]);
        }
        list.sort(Comparator.reverseOrder());
        for(int i=1; i<=div; i++)
        {
            answer += m * list.get(m*i-1);
        }
    
        return answer;
    }
}

익힐것
1. 기본 int[] 배열 정렬
Arrays.sort(array) : 오름차순 정렬
Arrays.sort(arr,Collections.reverseOrder()); : 내림차순 정렬
2. 리스트 정렬
list.sort(Comparator.reverseOrder());
list.sort(Comparator.naturalOrder());