양갱로그

N, M = map(int, input().split(' ')) arr = list(map(int, input().split(' '))) arr = sorted(arr) high = arr[-1] low = 0 def summation(arr, cut): res = 0 for tree in arr: if cut > tree: continue res += tree-cut return res while True: mid = (low+high)//2 res = summation(arr, mid) if res == M: print(mid) exit() if high-1 M: low = mid else: high = mid print(mid)

def solution(k,n, arr): high = arr[0] low = 0 result = 0 while low = n and mid > result: result = mid break if cnt < n: high = mid - 1 else: low = mid + 1 return result if __name__ == "__main__": K, N = map(int,input().split()) arr = [] for _ in range(K): arr.append(int(input())) arr.sort(reverse = True) print(solution(K, N, arr))