#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const ll nmax = 1e6+16;
ll n, k, x, a[nmax], res = 1, b[nmax], d = 0;
map<ll, ll> c;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);

    cin >> n >> k >> x;
    for(ll i = 1; i <= n; i++) cin >> a[i], c[a[i]]++;
    if(x == 0) return cout << c.size(), 0;
    sort(a + 1, a + n + 1);
    for(ll i = 2; i <= n; i++)
    {
        ll now = a[i] - a[i - 1];
        if(now > x) res++, b[++d] = now - 1;
    }
    sort(b + 1, b + d + 1);
    for(ll i = 1; i <= d; i++)
    {
        ll now = b[i];
        if((now / x) <= k) res--, k -= now / x;
        else break;
    }
    cout << res;
}