Pagini recente » Cod sursa (job #1394854) | Cod sursa (job #3252286) | Cod sursa (job #3276303) | Cod sursa (job #1455335) | Cod sursa (job #3239562)
#include <bits/stdc++.h>
#define DIM 100000
#define int long long
using namespace std;
//ifstream f("in.in");
//ofstream g("out.out");
ifstream f("branza.in");
ofstream g("branza.out");
int n,s,t;
int c[DIM+5],p;
int sol = 0;
deque <int> dq;
signed main()
{
f>>n>>s>>t;
for(int i=1;i<=n;i++){
f>>c[i]>>p;
while(!dq.empty() && i-dq.front() > t){
dq.pop_front();
}
while(!dq.empty() && (i-dq.back()) * s + c[dq.back()]> c[i]){
dq.pop_back();
}
dq.push_back(i);
sol += ((i-dq.front())*s + c[dq.front()])*p;
}
g<<sol<<'\n';
return 0;
}