#include <stdio.h>
#include <stdlib.h>
/*#include <conio.h>*/
#include <algorithm>
#include <vector>

using namespace std;

typedef struct{
  int a,b;
} gutuie;

int comp(const void *a, const void *b){
    gutuie x=*(gutuie*)a;
    gutuie y=*(gutuie*)b;
    
    return -x.a+y.a;
}



int main(){
    
    int i,n,h,p,u,max=0;
    gutuie x[100000];
    
    FILE *f = fopen("gutui.in","rt");
    fscanf(f,"%i %i %i\n",&n,&h,&u);
    
    for(i=0;i<n;i++)
    {
       fscanf(f,"%i %i\n",&x[i].a,&x[i].b);
       if(u!=0)
       if(x[i].a>h) x[i].a=-1;
       else x[i].a=(h-x[i].a)/u;
    }
    fclose(f);
    
    qsort(&x,n,sizeof(gutuie),comp);   
       
    vector<int> v(100000);
    i=0;
    for(p=x[0].a;p>=0;p--)
    {
      while(x[i].a==p && i<n)
      {
         v.push_back(x[i].b);   
         push_heap(v.begin(),v.end()); 
         i++;         
      }
   
       pop_heap(v.begin(),v.end());
       max+=v.back();
       v.pop_back();
    }
    
    
    f = fopen("gutui.out","wt");
    fprintf(f,"%i",max);
    fclose(f);
    
    return 0;
}