Pagini recente » Cod sursa (job #934396) | Cod sursa (job #343952) | Cod sursa (job #2875314) | Cod sursa (job #6934) | Cod sursa (job #2610325)
#include <fstream>
using namespace std;
ifstream cin("branza.in");
ofstream cout("branza.out");
int v[100001],d[100001];
int main()
{
int n,s,t,st,dr,i,p;
long long sum=0;
cin>>n>>s>>t;
st=0;
dr=-1;
for(i=0;i<n;i++)
{
cin>>v[i]>>p;
if(st<=dr&&d[st]==i-t)
st++;
while(st<=dr&&v[i]<=v[d[dr]]+s*(i-d[dr]))
dr--;
d[++dr]=i;
sum+=1LL*p*(v[d[st]]+1LL*s*(i-d[st]));
}
cout<<sum;
return 0;
}