링크 →

2805번: 나무 자르기

• 아영

  • 코드

  package Baekjoon.java.silver;
  
  import java.io.BufferedReader;
  import java.io.InputStreamReader;
  import java.io.*;
  import java.lang.*;
  import java.util.*;
  
  public class boj2805 {
      public static void main(String[] args) throws Exception{
          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[] trees = new int[N];
          st = new StringTokenizer(br.readLine());
          for (int i = 0; i < N; i++) {
              trees[i] = Integer.parseInt(st.nextToken());
          }
          Arrays.sort(trees);
  
          int left = 0;
          int right = trees[N-1];
          int answer = 0;
          while(left<=right){
              int mid = (left+right)/2;
              long sum = 0;
              for (int i = 0; i < N; i++) {
                  if(trees[i]>=mid) {
                      sum += trees[i] - mid;
                  }
              }
              if(sum<M){
                  right = mid-1;
              }else{
                  answer = mid;
                  left = mid+1;
              }
          }
          System.out.println(answer);
      }
  }
  

  • 시간,메모리

  

• 성우

  • 코드
  • 시간,메모리

• 은영

  • 코드

  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.StringTokenizer;
  
  public class baekjoon2805 {
  	static int N,M;
  	static int[] tree;
  	public static void main(String[] args) throws IOException {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer(br.readLine()+" ");
  		N=Integer.parseInt(st.nextToken());
  		M=Integer.parseInt(st.nextToken());
  		
  		tree = new int[N];
  		st = new StringTokenizer(br.readLine()+" ");
  		long max=0;
  		long min=0;
  		for (int i = 0; i < N; i++) {
  			tree[i] = Integer.parseInt(st.nextToken());
  			
  			max = Math.max(max, tree[i]);
  		}
  		
  		while(min<=max) {
  			long mid = (min+max)/2;
  			long sum=0;
  			for (int i = 0; i < N; i++) {
  				if(tree[i]-mid>0) {
  					sum+=(tree[i]-mid);
  				}
  			}
  			
  			if(sum>=M) {
  				min=mid+1;
  			}
  			else
  				max=mid-1;
  		}
  		System.out.println(min-1);
  		
  	}
  }
  

  • 시간,메모리

  

• 건

  • 코드
  • 시간,메모리

• 용문

  • 코드
  • 시간,메모리