[백준 2512] 예산

import sys
input=sys.stdin.readline
N = int(input())
arr = sorted(list(map(int, input().split())))
M = int(input())
low = M//N
high = arr[N-1]
mid = (low+high)//2
ans=0
def is_possible(num):
    return sum(min(r,num) for r in arr) <= M
while low <= high:
    if is_possible(mid):
        low = mid + 1
        ans=mid
    else:
        high = mid -1
    
    mid = (low + high) // 2
print(ans)

이걸 초딩도 푼다고? 어이없다