Pagini recente » Cod sursa (job #278951) | Cod sursa (job #962909) | Cod sursa (job #12467) | Cod sursa (job #484240) | Cod sursa (job #2341258)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("branza.in");
ofstream out("branza.out");
const int N = 100001;
int cost[N], nr[N], dq[N];
int main()
{
int n, s, t;
in >> n >> s >> t;
for(int i=0; i<n; i++) in >> cost[i] >> nr[i];
//t++;
int st=0, dr=-1;
long long rez=0;
for(int i=0; i<n; i++)
{
if(st<=dr && dq[st]==i-t)
st++;
while(st<=dr && cost[i]<=cost[dq[dr]]+(i-dq[dr])*s)
dr--;
dq[++dr]=i;
rez+=(cost[dq[st]]+(i-dq[st])*s)*(long long)nr[i];
}
out << rez;
return 0;
}