Merge pull request #2059 from CodingTestStudy2/최원준

[최원준] Day20

Author: github-actions[bot]

leetcode3/최원준/1665. Minimum Initial Energy to Finish Tasks.py

@@ -0,0 +1,12 @@
+class Solution:
+    def minimumEffort(self, tasks: list[list[int]]) -> int:
+        tasks.sort(key=lambda x: x[1] - x[0], reverse=True)
+
+        ans = 0
+        curr = 0
+
+        for actual, minimum in tasks:
+            ans = max(ans, curr + minimum)
+            curr += actual
+
+        return ans