#include<iostream> 
#include<cstdio>
#include<cstring> 
#include<algorithm>
using namespace std;
int n,m,a[1001010],h=0;
bool treee(int x)
{
    int tree=0;
	for(int i=1;i<=m;i++)
		if(a[i]>x)
			tree+=a[i]-x;
	if(tree==n)
		h=1;
	if(tree>=n)
		return true;
	else
		return false;
}
int tree()
{
	int left=1,right=a[m];
	while(left+1<right)
	{
		int mid=(left+right)/2;
		if (treee(mid))  
			left=mid;
		else
			right=mid;
		
	}
	if(treee(right))
		return right;
	else
		return left;
}

int main() 
{
	freopen("eko.in","r",stdin);
	freopen("eko.out","w",stdout);
	int i,s;
	cin>>m>>n;
	for(i=1;i<=m;i++)
		cin>>a[i];
	sort(a+1,a+m+1);
	cout<<tree();
	return 0; 
}