#include <fstream>
#include <algorithm>

using namespace std;

ifstream in("lupu.in");
ofstream out("lupu.out");

const int N= 1e5+10;

long long heap[N];


struct oaie
{
    long long dist, lana;
}oi[N];

long long s, n, x, l, l1;
/*void afisare()
{
    for (int i=1;i<=l1;i++)
    {
        out<<heap[i]<<" ";
    }
    out<<endl;
}*/
bool CompMic(oaie x, oaie y)
{
    if (x.dist==y.dist)
    {
        return x.lana>y.lana;
    }
    return x.dist<y.dist;
}

void urca(long long p)
{
    while (p > 1 && heap[p] > heap[p/2])
    {
        swap(heap[p], heap[p/2]);
        p /= 2;
    }
}

void adauga(long long x)
{
    heap[++l1]=x;
    urca(l1);
}

void coboara(long long p)
{
    long long fs = 2*p, fd = 2*p + 1, bun = p;
    if (fs <= l1 && heap[fs] > heap[bun])
    {
        bun = fs;
    }
    if (fd <= l1 && heap[fd] > heap[bun])
    {
        bun = fd;
    }
    if (bun != p)
    {
        swap(heap[p], heap[bun]);
        coboara(bun);
    }
}

void stergere()
{
    heap[1]=heap[l1];
    l1--;
    coboara(1);
}

int main()
{
    in>>n>>x>>l;
    for (long long i=1;i<=n;i++)
    {
        long long aux;
        in>>aux>>oi[i].lana;
        if (l!=0 && x-aux>=0)
            oi[i].dist=(x-aux)/l;
        else
        {
            if (l==0)
                oi[i].dist=N;
            else
            {
               oi[i].dist=-1;
            }
        }
    }
    sort(oi+1,oi+n+1,CompMic);
    long long nrmax=oi[n].dist, k=n;
    while(nrmax>=0)
    {
        while (k>=1 && oi[k].dist>=nrmax)
        {
            adauga(oi[k].lana);
            k--;
        }
        if (heap[1])
        {
            s+=heap[1];
            stergere();
        }
        nrmax--;

    }
    out<<s;
    return 0;
}