#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n, x;
    cin >> n >> x;
    vector<long long> a(n);
    long long total = 0;
    for (int i = 0; i < n; i++) { cin >> a[i]; total += a[i]; }

    long long lo = 0, hi = total / (1 + x), ans = 0;
    while (lo <= hi) {
        long long mid = (lo + hi) / 2;
        // Can we make 'mid' potions?
        // Need mid*(1+x) total liters
        // Each ingredient can contribute at most mid liters to "boil"
        long long need = mid * (1 + x);
        long long have = 0;
        for (int i = 0; i < n; i++)
            have += min(a[i], mid); // cap each at mid
        if (have >= need) {
            ans = mid;
            lo = mid + 1;
        } else {
            hi = mid - 1;
        }
    }
    cout << ans << endl;
    return 0;
}