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

def solution(k, m, score):
    answer = 0 
    score = sorted(score, reverse = True)
    for i in range(0, len(score), m):
        tmp = score[i:i+m]    
        if len(tmp) == m:
            answer += min(tmp) * m
    return answer