/*in the name of Allah the most beneficent the most merciful.*/
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define MAX 2e18
#define MIN -1e18
//#define MOD 1000000007
//#define mod2 20071027
#define MOD2 998244353
#define base 139
#define MOD 1000074259
#define base2 31
#define memz(a) memset(a, 0, sizeof(a))
#define memn(a) memset(a, -1, sizeof(a))
#define in1(a) scanf("%lld", &a)
#define in2(a, b) scanf("%lld%lld", &a, &b)
#define TC(c) printf("Case #%lld: ", ++c)
#define out(x) cout << #x << " -> " << x << endl;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define pi4 pair<pii, pii>
#define endl "\n"
#define all(x) x.begin(), x.end()
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FILE   freopen("input.txt", "r", stdin);  freopen("out.txt", "w", stdout);
using namespace std;
const ll N = 500010, M = 5010;
ll n, k, x,a[N];
vector<ll>v;
int main() {
    FAST
    cin>>n>>k>>x;
    for(int i=0; i<n; i++) {
        cin>>a[i];
    }
    sort(a, a+n);
    ll res=n;
    for(int i=1; i<n; i++) {
        ll d = a[i]-a[i-1];;
        ll m = d/x;
        if(d%x==0) m--;
        ll p = min(max(0LL, m), k);
        d-=x*p;
        if(d<=x) {
            v.pb(p);
        }
    }
    sort(v.begin(), v.end());
    for(auto u:v) {
        if(k>=u) {
            res--;
            k-=u;
        } else {
            break;
        }
    }
    cout<<res<<endl;
    return 0;
}
/*

*/
