#include<bits/stdc++.h>
using namespace std;
 
long long n,m,a[1000100],z;
long long f(long long x){
    long long ans = 0;
    for(int i = 1;i <= n;i++){
        if(a[i] > x){
            ans = ans + (a[i] - x);
        }
    }
    return ans;
}
 
int main(){
    cin>>n>>m;
    for(int i = 1;i <= n;i++){
        cin>>a[i]; 
        z=max(a[i],z);
    }
     
    long long l=1,r=z,mid;
    while(l <= r){
        mid = (l + r) >>1;
        if(f(mid) < m) r = mid-1;
        else l = mid + 1;
    }
    cout<<l-1;
}
/**************************************************************
	Problem: 1908
	User: linzihang
	Language: C++
	Result: Accepted
	Time:749 ms
	Memory:9888 kb
****************************************************************/