#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

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

struct oaie{
    int dist;
    int blana;
    bool operator <(const oaie &other)const{
        return dist < other.dist;
    }
};

vector <oaie> oi;
priority_queue <int> pq;

int main() {
    int n, x, l;
    long long sum = 0;
    cin >> n >> x >> l;
    for(int i = 0; i < n; i++){
        oaie coaie;
        cin >> coaie.dist >> coaie.blana;
        oi.push_back(coaie);
    }
    sort(oi.begin(), oi.end());
    int nivel = (x - oi[0].dist) / l;

    for(int i = 0; i < n; i++) {
        int candidateNivel = (x - oi[i].dist) / l;
        if (candidateNivel < nivel) {
            for(int j = 0; j < nivel - candidateNivel && !pq.empty(); j++) {
                sum += pq.top();
                pq.pop();
            }
            nivel = (x - oi[i].dist) / l;
        }
        pq.push(oi[i].blana);
    }
    while(nivel && !pq.empty()) {
        sum += pq.top();
        pq.pop();
        nivel--;
    }
    if(!pq.empty())
        sum += pq.top();
//    pq.pop();
    cout << sum;
    return 0;
}