#include<bits/stdc++.h> using namespace std; unsigned long long n,m,a[100086],l=1,mid,r; bool d(unsigned long long x){ unsigned long long s=0; for(int i=1;i<=n;i++){ if(x<a[i]) s=s+a[i]-x; if(s>=m) return 1; } return 0; } int main(){ scanf("%d %d",&n,&m); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); r=max(r,a[i]); } while(l<=r){ mid=l+r>>1; if(d(mid)) l=mid+1; else r=mid-1; } printf("%d",l-1); return 0; }