#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,all,ans;
ll a[1000005];
int main(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++){
	//	printf("lll\n");
		scanf("%lld",&a[i]);
	}
	ll start=1,end=400000,mid;
	while(start<=end){
		all=0;
		mid=start+(end-start)/2;
		for(int i=1;i<=n;i++){
//			if(a[i]>mid){
				all+=a[i]-mid;
//			}
		}
		if(all<m){
			start=mid+1;
		}
		if(all>=m){
			ans=max(mid,ans);
			end=mid-1;
		}
	}
	printf("%lld\n",ans);
	return 0;
} 

玄关！！！