[Python] Lv1 과일 장수

---

def solution(k, m, score):
	answer = 0
    
    score.sort(reverse=True)  # 내림차순으로 sorting
    
    for i in range(0, len(score)-(len(score)%m), m):
    	answer += sort[i+m-1] * m
        
    return answer