Hard
Reducing Dishes — Python
Full explanation · Time O(nlogn) · Space O(1)
# Time: O(nlogn)
# Space: O(1)
class Solution(object):
def maxSatisfaction(self, satisfaction):
"""
:type satisfaction: List[int]
:rtype: int
"""
satisfaction.sort(reverse=True)
result, curr = 0, 0
for x in satisfaction:
curr += x
if curr <= 0:
break
result += curr
return result