[오늘의 알고리즘] 구명보트

yongjun-0903/구명보트.py

@@ -0,0 +1,19 @@
+from collections import deque
+
+def solution(people, limit):
+    people.sort()
+
+    queue = deque(people)
+    count = 0
+    boat = []
+
+    while queue:
+        person = queue.popleft()
+        if sum(boat) + person <= limit and len(boat) <= 2:
+            boat.append(person)
+        else:
+            count += 1
+            boat = []
+    if boat:
+        count += 1
+    return count