Basic binary search #python #algorithm

2805 cutting trees.py

import sys
input=sys.stdin.readline
n,m = map(int,input().split())
trees=list(map(int,input().split()))
start, end = 0, max(trees)
result = 0
while start <= end:
    mid = (start + end) // 2
    cur_m = sum(x - mid for x in trees if x > mid)

    if cur_m >= m:
        result = mid
        start = mid + 1 #'조건을 만족한 경우에만 값을 별도 저장'
    else:
        end = mid - 1

print(result)