#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Codeforces Round #727 (Div. 2)
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,k,x;
    cin>>n>>k>>x;
    ll arr[n];
    f(i,0,n){
        cin>>arr[i];
    }
    sort(arr,arr+n);
    priority_queue<ll>pq;
    f(i,1,n){
        if(arr[i] - arr[i-1] > x){
            ll v = arr[i] - arr[i-1];
            v = (v + x - 1) / x;
            v--;
            pq.push(-v);
        }
    }
    while(!pq.empty() && k >= -pq.top()){
        ll f = -pq.top();
        pq.pop();
        k -= f;
    }
    cout<<pq.size() + 1<<"\n";
}
