Pagini recente » Cod sursa (job #2331965) | Cod sursa (job #490742) | Cod sursa (job #1966223) | Cod sursa (job #297151) | Cod sursa (job #2361973)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
long long n,i,s,t,k,v[100001],p,sum;
deque <long long> c;
int main(){
fin>>n>>s>>t;
for(i=1;i<=n;i++){
fin>>v[i]>>p;
while(!c.empty() && v[i]<v[c.back()]+s*(i-c.back()))
c.pop_back();
c.push_back(i);
sum+=p*(v[c.front()]+s*(i-c.front()));
}
fout<<sum;
return 0;
}