[백준]2805-나무 자르기(설명X)

#include <iostream>
using namespace std;
 
int main()
{
    int N, M, min = 0, max = 0;
    scanf("%d %d", &N, &M);
    int* trees = new int[N];
    for (size_t i = 0; i < N; i++) {
        scanf("%d", &trees[i]);
        if (max < trees[i])
            max = trees[i];
    }
    int answer = 0;
    while (max >= min) {
        unsigned long long sum = 0;
        int mid = (min + max) / 2;
        for (size_t i = 0; i < N; i++) {
            if (trees[i] > mid)
                sum += trees[i] - mid;
        }
        if (sum >= M) {
            answer = mid > answer ? mid : answer;
            min = mid + 1;
        }
        else
            max = mid - 1;
    }
    printf("%d", answer);
    return 0;
}

1654번 랜선 자르기와 똑같다.