Pagini recente » Cod sursa (job #1917761) | Cod sursa (job #148733) | Cod sursa (job #1857798) | Cod sursa (job #671245) | Cod sursa (job #2885551)
#include <bits/stdc++.h>
#define dim 100003
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
long long v[dim];
deque<long long> dek;
int main() {
long long n, s, t, c, p, min, suma = 0;
fin >> n >> s >> t;
for(int i = 1; i <= n; i++) {
fin >> v[i] >> p;
while( !dek.empty() && dek.front() < i - t )
dek.pop_front();
while( !dek.empty() && v[ dek.back() ] + (i - dek.back()) * s > v[i] )
dek.pop_back();
dek.push_back(i);
suma += p * (v[dek.front()] + (i - dek.front()) * s);
}
fout << suma;
return 0;
}