#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#define int long long
using namespace std;
const int maxn=1e6+10;
int n,m,a[maxn],r,l;
signed main(){
	scanf("%lld %lld",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
		r=max(r,a[i]);
	}
	while(l < r){
		int mid=(l+r) >> 1;
		int sum=0;
		for(int i=1;i<=n;i++){
			if(a[i] > mid) sum+=(a[i]-mid);
		}
		if(sum <= m) r=mid;
		else l=mid+1;
	}
	printf("%lld",l-1);
	return 0;
}