#include <bits/stdc++.h>
using namespace std;
const int N = 101001;
int n, m, q[N];
int main()
{
    cin >> n >> m;
    int maxx = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> q[i];
        if (q[i] > maxx)
            maxx = q[i];
    }
    int l = 0, r = maxx, ans = 0;
    while (l <= r)
    {
        int mid = l + r >> 1;
        int sum = 0;
        for (int i = 0; i < n; i++)
        {
            if (q[i] > mid)
                sum += (q[i] - mid);
        }
        if (sum >= m)
        {
            l = mid + 1;
            ans = mid;
        }
        else
            r = mid - 1;
    }
    cout << ans;
    return 0;
}