#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
int n,m;
const int maxn=1e6+5;
int a[maxn];
bool check(int x)//判断能否砍够m米树 
{
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		ans+=max(a[i]-x,0);
	}
	if(ans>m)return 1;
	return 0;
}
int find()//二分 
{
	int l=1;
	int r=2e9+5;
	while(l<=r)
	{
		int mid=(l+r)/2;
		if(check(mid))l=mid+1;
		else r=mid-1;
	}
	cout<<r+1;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)//输入 
	{
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	find();
}

https://www.luogu.com.cn/record/160919331 样例对