#include <bits/stdc++.h>
#include <deque>
using namespace std;

ifstream fin("branza.in");
ofstream fout("branza.out");

deque<int> d;
int n, t, s, p[100005], v[100005], c[100005];

int main(){
    fin>>n>>s>>t;
    int i, a;
    for(i=0;i<n;i++){
        fin>>c[i]>>p[i];
        v[i]=c[i]-i*s;
    }

    long long cmin=0;

    for(i=0;i<n;i++){
        while(!d.empty()&&v[i]<=v[d.back()])
            d.pop_back();
        if(!d.empty()&&d.front()==i-t)
            d.pop_front();
        d.push_back(i);
        int j=d.front();
        cmin+=(long long)(p[i]*(long long)(c[j]+(i-j)*s));
        //cout<<(i*s-v[d.front()])*p[i]<<endl;
    }

    fout<<cmin<<endl;
    return 0;
}