Pagini recente » Cod sursa (job #2405463) | Cod sursa (job #1114118) | Cod sursa (job #3225886) | Cod sursa (job #1690632) | Cod sursa (job #2320847)
#include <iostream>
using namespace std;
int main(){
long long c[100001], p[100001], n, s, t, st=0, dr=-1, dq[100001], rez=0;
cin>>n>>s>>t;
t++;
for(int i=0; i<n; i++){
cin>>c[i]>>p[i];
}
for(int i=0; i<n; i++){
if(st<=dr && dq[st]==(i-t)){
st++;
}
while(st<=dr && c[i]<=c[dq[dr]]+(i-dq[st])*s){
dr--;
}
dq[++dr]=i;
rez=rez+(c[dq[st]]+(i-dq[st])*s)*p[i];
}
cout<<rez;
return 0;
}