using namespace std;
long long int o[1000002],a,b,minn=0,maxx=1000000,mid=500,e=0;
int main()
{
	cin>>a>>b;
	for (int i=0;i<a;i++)
	cin>>o[i];
	while (minn<maxx)
	{
		for (int i=0;i<a;i++)
		if (o[i]>mid)
		e+=o[i]-mid;
		if (e>=b)
		minn=mid;
		else maxx=mid-1;
		mid=(maxx+minn)/2+1;
		e=0;
	}
	cout<<mid-1;
	return 0;
}