Create b2343.md

Author: JuSeong1130

juseong/binary_search/b2343.md

@@ -0,0 +1,56 @@
+
+어떤 한개를 기준으로 모두 되는지를 판단할때는 이분탐색 이용하면 좋을 것 같다
+
+```
+package binary_search;
+
+import java.util.*;
+
+public class B2343 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        String[] str = sc.nextLine().split(" ");
+        int N = Integer.parseInt(str[0]); // 강의의 수
+        int M = Integer.parseInt(str[1]); // 블루레이 개수
+
+        String[] nums = sc.nextLine().split(" ");
+
+        int start = Arrays.stream(nums)
+                .mapToInt(Integer::parseInt)
+                .max().getAsInt();
+        int end = Arrays.stream(nums)
+                .mapToInt(Integer::parseInt)
+                .sum();
+
+        int result = Integer.MAX_VALUE;
+        while (start <= end) {
+            int mid = (start + end) / 2;
+
+            int count = 0;
+            int sum = 0;
+            for (String s : nums) {
+                int num = Integer.parseInt(s);
+                int ss = num + sum;
+                if (ss > mid) {
+                    count++;
+                    sum = num;
+                } else {
+                    sum += num;
+                }
+            }
+            if (sum != 0) {
+                count++;
+            }
+
+            if (count <= M) {
+                result = Math.min(result, mid);
+                end = mid - 1;
+            } else {
+                start = mid + 1;
+            }
+        }
+        System.out.println(result);
+    }
+}
+
+```