#include<stdio.h>
void inserare(int a[20],int n,int x)
{
    int i;
    if(x>a[n-1])
	{
		a[n]=x;
	}
	for(i=n-1;i>=0&&x<a[i];i--)
    {
        a[i+1]=a[i];
    }
    a[i+1]=x;
}
void inserare_cu_n_constant(int a[],int n,int x)
{
    int i;
    for(i=1;x>a[i];i++)
    {
        a[i-1]=a[i];
    }
    a[i-1]=x;
}
int caut_max(int N,int h[],int g[],int H,int U,int *p)
{
    int i,max=0;
    for(i=0;i<N;i++)
    {
        if((h[i]>H-U)&&(h[i]<=H)&&(g[i]>max))
        {
            max=g[i];
            *p=i;
        }
    }
    return max;
}
int main()
{
    int N,H,U,i,j,x,totalg=0,max,*h,*g,*culese,index=0;
    FILE * pFile = fopen("gutui.in","r");
    FILE * dFile = fopen("gutui.out","w");
    fscanf(pFile,"%i",&N);
    fscanf(pFile,"%i",&H);
    fscanf(pFile,"%i",&U);
    h=(int*)malloc(N*sizeof(int));
    g=(int*)malloc(N*sizeof(int));
    culese=(int*)malloc(N*sizeof(int));
    for(i=0;i<N;i++)
    {
        fscanf(pFile,"%i",&h[i]);
        fscanf(pFile,"%i",&g[i]);
    }
    while(H>0)
    {
        printf("Verific intre inaltimea maxima %i si inaltimea minima %i\n",H,H-U);
        max=caut_max(N,h,g,H,U,&x);
        inserare(culese,index,max);
        printf("gutuia maxima curenta %i\n",max);
        index++;
        if(max)
        {
            g[x]=0;
        }
        for(j=0;j<N;j++)
        {
            max=caut_max(N,h,g,H,U,&x);
            if(max>culese[0])
            {
                printf("Inlocuiesc Gutuia cea mai mica din vector= %i cu gutuia max2= %i\n\n",culese[0],max);
                g[x]=0;
                inserare_cu_n_constant(culese,index,max);
            }
            else
            {
                break;
            }
        }
        H=H-U;
    }
    for(i=0;i<index;i++)
    {
        totalg=totalg+culese[i];
    }
    fprintf(dFile,"%i\n",totalg);
    fclose(pFile);
    fclose(dFile);
    return 0;
}