#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];
    }
    
    // Each potion needs 1 + x liters
    // Maximum possible
    long long max_potions = total / (1 + x);
    
    // Verify we can actually make this many
    sort(a.begin(), a.end(), greater<long long>());
    
    long long potions = 0;
    long long remaining = total;
    
    for (int i = 0; i < n && remaining >= 1 + x; i++) {
        long long can_boil = a[i];
        long long need_add = remaining - a[i];
        
        while (can_boil >= 1 && need_add >= x && remaining >= 1 + x) {
            potions++;
            can_boil--;
            need_add -= x;
            remaining -= (1 + x);
        }
    }
    
    cout << min(potions, max_potions) << endl;
    
    return 0;
}