#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
    int n, k, x;
    cin >> n >> k >> x;
    int a[n];
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    if (n == 1) {
        cout << "1" << endl;
        return 0;
    }
    vector<int> v;
    sort(a, a + n);
    for (int i = 0; i < n - 1; i++) {
        if (a[i + 1] - a[i] > x)
            v.push_back((a[i + 1] - a[i] - 1) / x);
    }
    sort(v.begin(), v.end());
    int ans, f = 0;
    for (int i = 0; i < v.size(); i++) {
        if (v[i] <= k) {
            k -= v[i];
        } else {
            f = 1;
            ans = v.size() - i + 1;
            break;
        }
    }
    if (f)
        cout << ans << endl;
    else
        cout << "1" << endl;
    return 0;
}