1# Runtime: 72 ms (Top 49.84%) | Memory: 13.8 MB (Top 58.81%)2class Solution:3 def minimumCost(self, cost: List[int]) -> int:4 cost.sort(reverse=True)5 res, i, N = 0, 0, len(cost)6 while i < N:7 res += sum(cost[i : i + 2])8 i += 39 return res
WPM •0 •0
ACC •0 •0
TIME •0