#include <bits/stdc++.h>
using namespace std;
const int N=1000005;
int n,m,k,s,t,h[N];
int check(int x){
	long long ans=0;
	for (int i=1;i<=n;++i) ans+=max(0,h[i]-x);
	return ans>=m;
}
int main()
{
	cin>>n>>m;
	int l=0,r=0;
	for (int i=1;i<=n;++i) cin>>h[i],r=max(r,h[i]);
	while (l<=r){
		int mid=(l+r)/2; 
		if (check(mid)) l=mid+1;
		else r=mid-1;
	}
	cout<<r;
}