#include<fstream>
#include<queue>
#include<vector>
#include<algorithm>
#define NMax 100005
using namespace std;
ifstream fin("lupu.in");
ofstream fout("lupu.out");

int N,X,L;
long long Sol;

vector < pair<int,int> > V;
priority_queue <int> PQ;

void Read()
{
    fin>>N>>X>>L;

    for(int i = 1 ; i <= N ; ++i)
    {
        int a,b;    fin>>a>>b;
        a = ( X - a ) / L;
        V.push_back(make_pair(a,b));
    }
}

bool Compare(pair<int,int> A,pair<int,int> B)
{
    return (A.first < B.first);
}

void Solve()
{
    sort(V.begin(),V.end(),Compare);

    for(int i = N - 1 , K = V[N-1].first ; K >=0 ; K--)
    {
        while(V[i].first == K && i >= 0)
        {
            PQ.push(V[i].second);
            i--;
        }

        if(!PQ.empty())
        {
            Sol += PQ.top();
            PQ.pop();
        }
    }
}

void Print()
{
    fout<<Sol<<"\n";
}

int main()
{
    Read();
    Solve();
    Print();

    fin.close();
    fout.close();
    return 0;
}