#include<iostream>
using namespace std;
const int maxn = 1e6 + 10;
int f[maxn];
int n, m;
long long sum;
int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> f[i];
    sort(f + 1, f + n + 1);
    sum = 0;
    int n1 = n;
    while(sum < m){
        sum += (f[n1] - f[n1 - 1]) * (n - n1 + 1);
        n1--;
    }
    n1++;
    int ans = f[n1 - 1] + (sum - m) / (n - n1 + 1);
    cout << ans << "\n";
    return 0;
}

已经自查过了，vscode可运行，样例也对