Merge pull request #1355 from AlgorithmWithGod/Seol-JY

[20251108] BOJ / G5 / 기타 레슨 / 설진영

Author: ShinHeeEul

Seol-JY/202511/08 BOJ G5 기타 레슨.md

@@ -0,0 +1,61 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        
+        int[] lectures = new int[N];
+        st = new StringTokenizer(br.readLine());
+        
+        int left = 0;
+        int right = 0;
+        
+        for (int i = 0; i < N; i++) {
+            lectures[i] = Integer.parseInt(st.nextToken());
+            left = Math.max(left, lectures[i]);
+            right += lectures[i];
+        }
+        
+        int answer = right;
+        
+        while (left <= right) {
+            int mid = (left + right) / 2;
+            
+            if (canDivide(lectures, M, mid)) {
+                answer = mid;
+                right = mid - 1;
+            } else {
+                left = mid + 1;
+            }
+        }
+        
+        System.out.println(answer);
+    }
+    
+    private static boolean canDivide(int[] lectures, int M, int size) {
+        int count = 1;
+        int currentSum = 0;
+        
+        for (int lecture : lectures) {
+            if (currentSum + lecture > size) {
+                count++;
+                currentSum = lecture;
+                
+                if (count > M) {
+                    return false;
+                }
+            } else {
+                currentSum += lecture;
+            }
+        }
+        
+        return true;
+    }
+}
+```