Pagini recente » Cod sursa (job #2206088) | Cod sursa (job #2520700) | Cod sursa (job #2762859) | Cod sursa (job #2973748) | Cod sursa (job #3241120)
#include<fstream>
#include<deque>
using namespace std;
ifstream fin ("branza.in");
ofstream fout("branza.out");
int c[100001], q[100001];
long long n, s, t, sum, i;
deque<int>dq;
int main(){
fin>>n>>s>>t;
for(i=1;i<=n;i++){
fin>>c[i]>>q[i];
while(dq.empty()==false && c[i]<=c[dq.back()]+(i-dq.back())*s)
dq.pop_back();
dq.push_back(i);
if(i-dq.front()==t+1)
dq.pop_front();
sum+=c[dq.front()]*q[i]+(i-dq.front())*s*q[i];;
}
fout<<sum<<" ";
}