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

int n=0;


			

void sortg(int *a, int *b){
	  int i,j;
	
		for(i=0;i<n;i++)
			for(j=n-1;j>i;j--)
				if(b[j]< b[j-1]) {
					  int t1,t2;
					t1=a[j]; a[j]=a[j-1]; a[j-1]=t1;
					t2=b[j]; b[j]=b[j-1]; b[j-1] =t2;
				}
				
	
}


int main ()
{
	  int  i,u,h;
	FILE *f1, *f2;
	  int *a,*b;
	f1=fopen("gutui.in","r");
	f2=fopen("gutui.out", "w");
	fscanf(f1,"%d",&n);
	fscanf(f1,"%d",&h);
	fscanf(f1,"%d",&u);
	a = (   int*)malloc( n* sizeof(   int));
	b = (   int*)malloc( n* sizeof(   int));
	
	for(i=0;i<n;i++){
		a[i]=(  int)malloc(sizeof(  int)); //inaltimile
		b[i]=(  int)malloc(sizeof(  int)); //greutatile

		fscanf(f1,"%d",&a[i]);
		fscanf(f1,"%d", &b[i]);
		
	}
	
	  int s=0; 
	
	sortg(a,b);
	//for(i=0;i<n;i++)
		//printf("%ld -",a[i]);
	int max=0;
	for(i=0;i<n;i++)
		if((h-a[i])/u >max ) max= (h-a[i])/u;
	
	


	//max=k;
	//printf("min%d ", max);
	 int *tmp;
	 tmp= (int*)calloc((max+1), sizeof(int));

		
	for(i=n-1;i>=0;i--){
		if(a[i]<=h){
		if(tmp[(h-a[i])/u]==0)
			tmp[(h-a[i])/u]=b[i]; /*printf("%ld ", a[i]);*/
		else
		{
			int  poz =(h-a[i])/u -1;
			while(poz>=0 && tmp[poz]!=0){
			 poz--;
			}
			
			 if(poz>=0) tmp[poz] =b[i];
		 }
	 }
		}
	
	for(i=0;i<max+1;i++)
		s=s+tmp[i];
	
	
    fprintf(f2,"%d",s);
    fclose(f1);fclose(f2); 
    return 0;
     
}