Pagini recente » Cod sursa (job #1700261) | Cod sursa (job #497635) | Cod sursa (job #1578259) | Cod sursa (job #2089932) | Cod sursa (job #2490956)
#include <fstream>
#define N 100001
using namespace std;
int v[N], q[N];
int main()
{
ifstream fin("branza.in");
ofstream fout("branza.out");
int n, i, s, k, st=1, dr=0, t;
long long ss = 0;
fin >> n >> s >> k;
for( i = 1; i <= n; i++ ){
fin >> v[i] >> t;
while(v[i] <= v[q[dr]] + ( i - q[dr] ) * s && st <= dr )
dr--;
dr++;
q[dr] = i;
if( q[st] + k < i )
st++;
ss += v[q[st]] * t + s * ( i- q[st] ) * t;
}
fout << ss;
return 0;
}