#include <stdio.h>
#include <stdlib.h>

#define NMAX 100001

void adauga1 (long int v[NMAX], long int val, long int n) {
	v[n] = val;
	long int i=n;
	while ((val < v[i-1]) && (i>0)){
		v[i] = v[i-1];
		v[i-1] = val;
		i--;
	}


}

void adauga2 (long int v[NMAX], long int val, long int n) {
	long int i=1;
	v[1] = val;
	while ((val > v[i+1]) && (i<n)) {
		v[i] = v[i+1];
		v[i+1] = val;
		i++;
	}

}

void insereaza (long int nivel[NMAX], long int gr[NMAX], long int j, long int val, int n) {
	while (j < nivel[n-1]) {
		nivel[n] = nivel[n-1];
		gr[n] = gr[n-1];
		n--;
	}

	
	nivel[n] = j;
	gr[n] = val;
}

long int min (long int v[NMAX], long int n) {
	long int minim = n;
	long int i;
	for (i=n-1; i>0; i--) {
		if (v[i] == 0) {
			return i;
		}
		if (v[i] < v[minim]) {
			minim = i;
		}
	}
	return minim;
}

int main () {

FILE *f, *g;
long int n, hmax, u, h, val, s=0, i, j, v[NMAX];


f = fopen ("gutui.in", "r");
g = fopen ("gutui.out", "w");

fscanf (f, "%ld", &n);
fscanf (f, "%ld", &hmax);
fscanf (f, "%ld", &u);

for (i=1; i<=n; i++) {
	fscanf (f, "%ld", &h);
	fscanf (f, "%ld", &val);
	j = (hmax-h)/u + 1;
	if (v[j] == 0) {
		v[j] = val;
		s +=val;
	}
	else {
		long int k = min (v, j);
		if (val > v[k]) {
			s = s-v[k]+val;
			v[k] = val;
		}
	}
}

fprintf (g, "%ld", s);
	

fclose (f); fclose (g);

return 0;
}