🐜 Study: 피로도 (#80)

Author: ing-eoking

피로도.py

@@ -0,0 +1,4 @@
+from itertools import permutations
+
+def solution(k, dungeons):
+    return max((lambda t: sum((t := t - j) >= 0 and t + j >= i for i, j in p))(k) for p in permutations(dungeons))