#include <bits/stdc++.h>
using namespace std;
int n,m,high,Now,o,Nowm=0;
int h[1000005],high_for[1000005];
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;++i) cin>>h[i];
    sort(h+1,h+n+1); 
    for(int i=2;i<=n;++i) high_for[i]=h[i]-h[i-1]; 
    for(o=n;o>=1;--o){
        Now=h[o];
        Nowm+=high_for[o+1]*(n-o);
        if(Nowm>=m) break;
    }
    cout<<Now<<endl;
    return 0;
}