Pagini recente » Cod sursa (job #1425560) | Cod sursa (job #2417330) | Cod sursa (job #1554752) | Cod sursa (job #1112580) | Cod sursa (job #960352)
Cod sursa(job #960352)
#include<cstdio>
using namespace std;
int i;
struct branza
{
int z;
long long c;
};
branza dq[100100];
int st=1,dr=0,t,n;
long long cant,cost,s;
long long total;
void stanga()
{
if(i-dq[st].z>t)
st++;
}
void dreapta()
{
while((long long)dq[dr].c*cant+(i-dq[dr].z)*s*cant>(long long)cost*cant&&dr>=st)
{
dr--;
}
dq[++dr].c=cost;
dq[dr].z=i;
}
int main()
{
freopen("branza.in","r",stdin);
freopen("branza.out","w",stdout);
scanf("%d%d%d",&n,&s,&t);
for(i=1;i<=n;i++)
{
stanga();
scanf("%d%d",&cost,&cant);
dreapta();
total+=(long long)dq[st].c*cant;
if(dq[st].z<i)
total+=(long long)s*cant*(i-dq[st].z);
}
printf("%lld",total);
return 0;
}