#include<bits/stdc++.h>
using namespace std;
long long n,m,ans=0,mid;
long long a[10000008];
int main()
{   long long begin,end;
    scanf("%lld%lld",&n,&m);
    for(int i=1;i<=n;i++)
    {scanf("%lld",&a[i]);
    end=max(begin,a[i]);
	}
    while(begin<=end)
	{
	ans=0;
	mid=(begin+end)/2;
    for(int i=1;i<=n;i++)
    	if(a[i]>mid)
    	ans+=a[i]-mid;
    	if(ans<m)
    	end=mid-1;
    	else begin=mid+1;

		}
			cout<<begin-1;
	return 0;
}