Pagini recente » Cod sursa (job #564326) | Cod sursa (job #931018) | Borderou de evaluare (job #1993670) | Cod sursa (job #802399) | Cod sursa (job #2071494)
#include <cstdio>
using namespace std;
FILE *in,*out;
const int nmax = 100005;
int d[nmax],c[nmax],p[nmax];
int main()
{
in = fopen("branza.in","r");
out = fopen("branza.out","w");
int n,s,t,st = 1,dr = 0;
long long sol = 0;
fscanf(in,"%d %d %d",&n,&s,&t);
for(int i = 1;i <= n;i ++)
{
fscanf(in,"%d %d",&c[i],&p[i]);
if(st <= dr && d[st] == i-t)
st ++;
while(st <= dr && (c[i] <= (c[d[dr]] + s*(i-d[dr]))))
dr --;
d[++dr] = i;
sol += 1LL*(1LL*p[i] * (1LL*c[d[st]] + 1LL*s * (i- d[st])));
}
fprintf(out,"%lld",sol);
return 0;
}