Merge pull request #148 from AlgoLeadMe/8-jung0115

8-jung0115

jung0115/README.md

@@ -8,4 +8,5 @@
 | 4차시 | 2024.07.27.토 | 트리 / 트라이 | [개미굴(14725)](https://www.acmicpc.net/problem/14725) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/134 |
 | 5차시 | 2024.07.31.수 | 트리 / MST | [1251. [S/W 문제해결 응용] 4일차 - 하나로](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV15StKqAQkCFAYD) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/137 |
 | 6차시 | 2024.08.03.토 | 트리 / 트라이 | [디스크 트리(7432)](https://www.acmicpc.net/problem/7432) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/142 |
-| 7차시 | 2024.08.07.수 | 다익스트라 | [지형이동](https://school.programmers.co.kr/learn/courses/30/lessons/62050) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/144 |
+| 7차시 | 2024.08.07.수 | 다익스트라 | [지형 이동(Lv.4)](https://school.programmers.co.kr/learn/courses/30/lessons/62050) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/144 |
+| 8차시 | 2024.08.19.월 | 이분 탐색 | [입국심사(Lv.3)](https://school.programmers.co.kr/learn/courses/30/lessons/43238) | https://github.com/AlgoLeadMe/AlgoLeadMe-4/pull/148 |

jung0115/다익스트라/Programmers_62050.java

@@ -63,7 +63,6 @@ public Point(int x, int y, int cost) {
       this.cost = cost;
     }
 
-
     // 우선순위: 비용이 작은 순
     @Override
     public int compareTo(Point o) {

jung0115/이분 탐색/Programmers_43238.kt

@@ -0,0 +1,24 @@
+// 8차시 2024.08.19.월 : 프로그래머스 - 입국심사(Lv.3)
+class Solution {
+  fun solution(n: Int, times: IntArray): Long {
+    var min: Long = 0
+    var max: Long = (times.maxOrNull()!!.toLong() * n)
+
+    while (min < max) {
+      val mid: Long = (min + max) / 2
+      var complete: Long = 0
+
+      for (time in times) {
+        complete += mid / time
+      }
+
+      if (complete >= n) {
+        max = mid
+      } else {
+        min = mid + 1
+      }
+    }
+
+    return min
+  }
+}