class Solution:
def maximumHappinessSum(self, happiness: List[int], k: int) -> int:
return sum([max(x - i, 0) for i, x in enumerate(sorted(happiness, reverse=True)[:k])])
오랜만에 1-Liner
class Solution:
def maximumHappinessSum(self, happiness: List[int], k: int) -> int:
return sum([max(x - i, 0) for i, x in enumerate(sorted(happiness, reverse=True)[:k])])
오랜만에 1-Liner
댓글 0