[백준 2805번] 나무 자르기

소스코드

---

#include <iostream>
using namespace std;
 
int main() {
    long long n, m, num[1000001], Max = -1, left = 1, right = 1000000000;
    cin >> n >> m;
    for (int i = 0; i < n; i++)
        cin >> num[i];
 
    while (left<=right) {
        long long sum=0,mid = (left + right) / 2;
        for (int i = 0; i < n; i++)
            sum += (num[i] - mid>0?num[i]-mid:0);
        if (sum >= m) {
            left = mid+1;
            if (mid > Max)
                Max = mid;
        }
        else {
            right = mid-1;
        }
    }
 
    cout << Max << '\n';
    return 0;
}