[프로그래머스] / [Level 1] / [Python] 과일 장수

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

프로그래머스

---

def solution(k, m, score):
    answer = 0
    
    score.sort(reverse=True)
    
    div= len(score)//m

    for i in range(div):
        answer += min(score[m*i:m*i+m]) * m
    
    return answer