[백준][Java] 1920번 수 찾기 (이진탐색)

[백준][Java] 1920번 수 찾기 (이진탐색)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57

import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.OutputStreamWriter; public class Main { private static BufferedReader br = new BufferedReader( new InputStreamReader( System . in )); private static BufferedWriter bw = new BufferedWriter( new OutputStreamWriter( System . out )); public static void main( String [] args) throws IOException{ String [] str = br.readLine(). split ( " " ); int N = stoi(str[ 0 ]); int M = stoi(str[ 1 ]); int [] height = new int [N]; str = br.readLine(). split ( " " ); for ( int i = 0 ; i < N; i + + ) height[i] = stoi(str[i]); int left = 0 ; int right = 2000000000 ; int mid = 0 ; int res = 0 ; while (left < = right) { mid = (left + right) / 2 ; long wood = 0 ; for ( int h : height) wood + = (h - mid < = 0 )? 0 :h - mid; if (wood < M) right = mid - 1 ; else { left = mid + 1 ; res = mid; } } System . out . println (res); // bw.write(""); // bw.flush(); // bw.close(); } private static int stoi( String input) { return Integer. parseInt (input); } } Colored by Color Scripter

from http://aig2029.tistory.com/341 by ccl(A) rewrite - 2021-10-14 17:27:26