Pagini recente » Cod sursa (job #744887) | Cod sursa (job #3181119) | Cod sursa (job #959183) | Cod sursa (job #737295) | Cod sursa (job #2049448)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
int v[100000], d[100000];
int main()
{
int n, k, t, p, i, x, sum, st, dr;
f >> n >> t >> p;
dr = -1;
for ( i = st = sum = 0; i < n; i++ ) {
f >> v[i] >> x;
if ( st <= dr && d[st] == i-p ) {
st++;
}
while ( st <= dr && v[d[dr]] + ( i - d[dr] ) * t >= v[i] ) {
dr--;
}
d[++dr] = i;
sum = sum + x * (v[d[st]] + ( i - d[st] ) * t);
}
g << sum;
f.close();
g.close();
return 0;
}