#include <iostream>
#include <unordered_map>
#include <iomanip>
#include <unordered_set>
#include <list>
#include <queue>
#include <string>
#include <stack>
#include <set>
#include <map>
#include <climits>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
#define ll long long int
int main()
{
    ll n, k, x;
    cin >> n >> k >> x;
    ll a[n];
    for (ll i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    sort(a, a + n);
    vector<ll> mp;
    for (ll i = 1; i < n; i++)
    {
        if ((a[i] - a[i - 1]) > x)
        {
            mp.push_back(a[i] - a[i - 1]);
        }
    }
    sort(mp.begin(), mp.end());
    ll count = mp.size();
    for (auto it : mp)
    {
        ll req = (it) / x;
        if (it % x != 0)
        {
            req++;
        }
        if ((req - 1) <= k)
        {
            k = k - (req - 1);
            count--;
        }
        else
        {
            break;
        }
    }
    cout << count + 1 << endl;
}