Pagini recente » Cod sursa (job #2013377) | Cod sursa (job #2959932) | Cod sursa (job #1389) | Cod sursa (job #1672079) | Cod sursa (job #2065751)
#include <fstream>
using namespace std;
ifstream in("branza.in");
ofstream out("branza.out");
int const N=100001;
int d[N], c[N];
int main()
{
int n, s, t, st=0, dr=-1, p, sum=0;
in>>n>>s>>t;
t++;
for(int i=0; i<n; i++)
{
in>>c[i]>>p;
if(st<=dr && d[st]==i-t) st++;
while(st<=dr && c[i]<=c[d[dr]]+s*(i-d[dr])) dr--;
d[++dr]=i;
sum+=p*(c[d[st]]+s*(i-d[st]));
}
out<<sum;
return 0;
}