Merge pull request #2021 from CodingTestStudy2/최민지

[최민지] Day13

Author: github-actions[bot]

leetcode3/최민지/1665.py

@@ -0,0 +1,15 @@
+class Solution:
+    def minimumEffort(self, tasks: List[List[int]]) -> int:
+        tasks.sort(key=lambda x: x[1] - x[0], reverse=True)
+
+        answer = 0
+        energy = 0
+
+        for actual, minimum in tasks:
+            if energy < minimum:
+                answer += minimum - energy
+                energy = minimum
+
+            energy -= actual
+
+        return answer