Pagini recente » Cod sursa (job #440594) | Cod sursa (job #1106832) | Cod sursa (job #1655227) | Cod sursa (job #920647) | Cod sursa (job #911913)
Cod sursa(job #911913)
#include <cstdio>
using namespace std;
long long d[100100];
long long s,t;
long long sol;
long long a[100100],b[100100];
int beg;
int end;
int main()
{
freopen("branza.in","r",stdin);
freopen("branza.out","w",stdout);
int n;
scanf("%d%lld%lld",&n,&s,&t);
beg=1;
sol=0;
for(int i=1;i<=n;i++)
{
scanf("%lld%lld",&a[i],&b[i]);
while(beg<end&&i-d[beg]>t)
beg++;
while(beg<end&&a[d[beg]]+(i-d[beg])*s>a[i])
end--;
d[++end]=i;
sol+=a[d[beg]]*b[i]+b[i]*(i-d[beg])*s;
}
printf("%lld",sol);
return 0;
}