#include<cstdio>
#include<cstdlib> 
#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
int m,n;
long long a[1000010],maxx=0;
int check(int yu)
{
	long long sum=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]>yu)
			sum+=a[i]-yu;
	}
	return sum>=m;
}
int asd()
{
	int left=0,right=maxx;
	for(;left+1<=right;)
	{
		int mid=(right+left)/2;
		long long sum=0;
		for(int i=1;i<=n;i++)
		{
			if(a[i]>mid)
				sum+=a[i]-mid;
		}
		if(sum>=m)left=mid;
		if(sum<=m)right=mid;
	}
	if(check(right))return right;
	if(check(left))return left;
}
int main()
{
	
	freopen("eko.in","r",stdin);
	freopen("eko.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		maxx+=a[i];
	}
	cout<<asd()<<endl;
	return 0;
}