Level 1. 과일 장수

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

프로그래머스

 

Code

def solution(k, m, score):
    answer = 0
    temp = []

    score.sort(reverse=True)

    for n in score:
        temp.append(n)
        if len(temp) == m:
            temp.sort()
            if temp[0] <= k:
                answer += (temp[0] * m)
                temp = []
    
    return answer