#include <stdio.h>
#include <stdio.h>
//#include <file.h>
#include <stdlib.h>
#include <queue>
using namespace std;


typedef struct gutuie{
	
	int h;
	int g;
	}gutuie;


int compareH (const void * a, const void * b)
{
	gutuie *ax = (gutuie * )a;  
	gutuie *bx = (gutuie *)b;
	return (*ax).h-(*bx).h;
//	return ( (*(int *)a).h-(*(int *)b).h );
}

int compareG (const void * a, const void * b)
{
	gutuie *ax = (gutuie * )a;  
	gutuie *bx = (gutuie *)b;
	return (*ax).g-(*bx).g;

}


int main(){

int N,H,U;

FILE *in;
FILE *out;
in = fopen("gutui.in","r");
out=fopen("gutui.out","w");
fscanf(in,"%d",&N);//nr de gutui
fscanf(in,"%d",&H);//inaltimea la care ajunge Gigel
fscanf(in,"%d",&U);//cu cat se ridica crengile

priority_queue< int, vector<int>, greater<int> > pq;//o coada de prioritati, cel mai important
							//fiind elementul cel mai mic


gutuie *vGut;//vectorul de gutui :D

vGut = (gutuie *)malloc(N*sizeof(gutuie));


//citire din fisier
for(int i=0;i < N;i++){
	fscanf(in,"%d",&vGut[i].h);
	fscanf(in,"%d",&vGut[i].g);

	}


//qsort (vGut, N, sizeof(gutuie), compareH);//sortez vectorul de gutui


int copieH = H;
int copieN=N;


int j=0;



pq.push(vGut[N-1].g);//adaug primul element din 



copieH=copieH-U;

for(int i=N-2;i>=0;i--){
	
	if(vGut[i].h<=copieH){
		
		pq.push(vGut[i].g);
		copieH=copieH-U;

					
		}

	else if(vGut[i].g>pq.top()){
		      
			pq.pop();
			pq.push(vGut[i].g);						
				}
	}

int suma=0;
while(!pq.empty()){
	suma=suma+pq.top();
	pq.pop();	
	}
fprintf(out,"%d",suma);
fclose(in);
fclose(out);	
	

}