과일 장수

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int solution(int k, int m, vector<int> score) 
{
    //k : 최고점수, m : m개씩 포장
    int answer = 0;
    int size = score.size();
    int i;
    
    sort(score.begin(), score.end(), greater<int>());
    for(i = 0; i < size / m; i++)
    {
        answer += score[(i + 1) * m - 1] * m;
    }
    
    return answer;
}