프로그래머스 / 과일 장수

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

파이썬

for 문을 이용. 

def solution(k, m, score):
    score.sort(reverse=True)
    return sum(score[index] * m for index in range(m - 1, len(score), m))

slice를 이용. 

def solution(k, m, score):
    return sum(sorted(score, reverse=True)[m - 1:: m]) * m

 

코틀린

class Solution {
    fun solution(k: Int, m: Int, score: IntArray): Int {
        val sortedScore = score.sortedDescending()
        return ((m - 1) until score.size step (m))
            .sumOf { sortedScore[it] * m }
    }
}

class Solution {
    fun solution(k: Int, m: Int, score: IntArray) = score
        .sortedDescending()
        .slice((m - 1) until score.size step (m))
        .sumOf { it * m }
}