릿코드 1561. Maximum Number of Coins You Can Get 코틀린

배열을 정렬하고,
배열은 반드시 3n배수의 배열이니,아래쪽 1/3은 남은거줏어먹는 거지한테 주고(subList)
남은거중 2n번에 있는걸 sum해서 리턴

 

정답

class Solution {
    fun maxCoins(piles: IntArray): Int {
        val sortList = piles.sorted().reversed()
        val subList = sortList.subList(0,sortList.size/3*2)
        val filterIndexed=subList.filterIndexed { index, i -> (index-1).mod(2) == 0 }

        return filterIndexed.sum()

    }
}