[42일차][프로그래머스][135808]과일 장수

import math

def solution(k, m, score):
    sort_score = sorted(score, reverse=True)
    box_count = math.floor(len(score) / m)
    result = 0

    if box_count == 0:
        return 0
    else:
        for idx1 in range(box_count):
            if idx1 == 0:                
                result += min(sort_score[idx1:idx1+m]) * m
            else:
                result += min(sort_score[idx1*m:idx1*m+m]) * m
                      
    return result