#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
long long n,m,a[1008686],ans=-10e7,t=0,l,r,mid;
bool cmp(long long x,long long y)
{
	return x<y;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		{	
			cin>>a[i];
		}
	sort(a+1,a+n+1,cmp);
	l=1;
	r=a[n];
	while(l<r)
	{	t=0;
		mid=(l+r)>>2;
		for(int i=1;i<=n;i++)
			{
				if(mid<a[i]){t=t+a[i]-mid;}
			}
		if(t<m){r=mid-1;}
		if(t>m){l=mid+1;}
		if(t==m&&ans<mid){ans=mid;}
	}
	cout<<ans;
}