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

(Lv.01) 과일장수👾
https://school.programmers.co.kr/learn/courses/30/lessons/135808

def solution(k, m, score):
    answer = 0
    score.sort(reverse=True)
    for i in range(0,len(score),m):
        l=score[i:i+m]
        if len(l)<m:
            continue
        answer+=l[-1]*m
    return answer