好奇怪的題目
一二三四五
又水了一天
def maximumHappinessSum(self, happiness: List[int], k: int) -> int:
happiness.sort()
cur_cost = 0
s = 0
for i in range(len(happiness)-1, len(happiness)-k-1, -1):
s += max((happiness[i]-cur_cost),0)
cur_cost += 1
return s

大師

我好崇拜你