#include <bits/stdc++.h>
using namespace std;
long long m,n,a[1000005];
long long l,r,mid,ans = 0;
bool check(long long mid){
	long long cmp = 0;
	for(long long i = 1;i <= n; i++){
		if(a[i] >= mid)
			cmp += a[i]-mid;
	}
	if(cmp >= m)
		return 1;
	return 0;
}
int main(){
	cin >> n >> m;
	for(long long i = 1;i <= n; i++){
		cin >> a[i];
		r += a[i];
	}
	while(l < r){
		mid = (l+r)/2;
		if(check(mid) == 1){
			ans = mid;
			l = mid+1;
		}
		else
			r = mid-1;
	}
	cout << ans;
	return 0;
} ```