diff --git a/jung0115/README.md b/jung0115/README.md
index 4be6731..d023f18 100644
--- a/jung0115/README.md
+++ b/jung0115/README.md
@@ -23,4 +23,5 @@
 | 19차시 | 2024.10.16.수 | 분할정복 | [괄호 변환(Lv.2)](https://school.programmers.co.kr/learn/courses/30/lessons/60058) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/178 |
 | 20차시 | 2024.10.19.토 | 백트래킹 | [불량 사용자(Lv.3)](https://school.programmers.co.kr/learn/courses/30/lessons/64064) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/180 |
 | 21차시 | 2024.10.23.수 | DFS | [여행경로(Lv.2)](https://school.programmers.co.kr/learn/courses/30/lessons/43164) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/181 |
-| 22차시 | 2024.10.30.수 | 브루트포스 | [점 찍기(Lv.2)](https://school.programmers.co.kr/learn/courses/30/lessons/140107) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/182 |
\ No newline at end of file
+| 22차시 | 2024.10.30.수 | 브루트포스 | [점 찍기(Lv.2)](https://school.programmers.co.kr/learn/courses/30/lessons/140107) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/182 |
+| 23차시 | 2024.11.02.토 | 그리디 알고리즘 | [구명보트(Lv.2)](https://school.programmers.co.kr/learn/courses/30/lessons/42885) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/184 |
\ No newline at end of file
diff --git "a/jung0115/\352\267\270\353\246\254\353\224\224\354\225\214\352\263\240\353\246\254\354\246\230/Programmers_42885.py" "b/jung0115/\352\267\270\353\246\254\353\224\224\354\225\214\352\263\240\353\246\254\354\246\230/Programmers_42885.py"
new file mode 100644
index 0000000..a6b54b6
--- /dev/null
+++ "b/jung0115/\352\267\270\353\246\254\353\224\224\354\225\214\352\263\240\353\246\254\354\246\230/Programmers_42885.py"
@@ -0,0 +1,21 @@
+# 23차시 2024.11.02.토 : 프로그래머스 - 구명보트(Lv.2)
+from collections import deque
+
+def solution(people, limit):
+    answer = 0
+    people.sort(reverse = True)
+    queue = deque(people)
+    
+    while len(queue) > 1 :
+      if queue[0] + queue[-1] <= limit :
+        queue.pop()
+        queue.popleft()
+        answer += 1
+      else :
+        queue.popleft()
+        answer += 1
+    
+    if len(queue) > 0 :
+      answer += 1
+    
+    return answer
\ No newline at end of file