백준 알고리즘 - 2805. 나무 자르기

https://www.acmicpc.net/problem/2805

2805번: 나무 자르기

 

전체 풀이

# Code
def solution(trees: list, m):
    result = 0
    low, high = 1, sum(trees)
    while low <= high:
        mid = (low + high) // 2

        tree_amount = sum([tree - mid for tree in trees if tree > mid])

        if tree_amount >= m:
            low = mid + 1
            result = mid
        else:
            high = mid - 1

    return result


# --- submit ---
n, m = map(int, input().split())
heights = list(map(int, input().split()))
print(solution(heights, m))