2023.03.29 Today's Challenge

https://leetcode.com/problems/reducing-dishes/

Reducing Dishes - LeetCode

선 정렬후 풀면 되는 문제. 생각보다 간단

class Solution:
    def maxSatisfaction(self, satisfaction: List[int]) -> int:
        satisfaction.sort(reverse=True)
        n = len(satisfaction)
        presum, res = 0, 0
        for i in range(n):
            presum += satisfaction[i]
            if presum < 0:
                break
            res += presum
        return res