#include<bits/stdc++.h> using namespace std; typedef long long ll; const int MAX=1e6+10; int a[MAX]; int n; ll need; ll check(int h) { ll sum = 0; for(int i = 1; i <= n; i++){ if(a[i]>h) sum+=a[i]-h; } return sum; }

int main(){ freopen("tree.in","r",stdin); freopen("tree.out","w",stdout); ios::sync_with_stdio(false); cin.tie(nullptr); cin>>n>>need; int max_h = 0; for(int i=1;i<=n;i++){ cin>>a[i]; max_h=max(max_h,a[i]); } int l=0,r=max_h; int ans=0; while(l<=r){ int mid=l+(r-l)/2; ll total=check(mid); if(total>=need){ ans=mid; l=mid+1; }else{ r=mid-1; } } cout<<ans<<endl; return 0; }