Pagini recente » Cod sursa (job #2077793) | Cod sursa (job #1605642) | Cod sursa (job #2490782) | Cod sursa (job #2512506) | Cod sursa (job #2561338)
#include <fstream>
using namespace std;
ifstream in("branza.in");
ofstream out("branza.out");
const int N=100001;
struct pret{
int c,p;
};
pret v[10];
int dq[10];
long long sum;
int main()
{
int n,s,t,dr,st;
in>>n>>s>>t;
for(int i=0; i<n; i++)
{
in>>v[i].p>>v[i].c;
}
dr=-1;
st=0;
for(int i=0; i<n; i++)
{
if(st<=dr && dq[st]==i-t)
{
st++;
}
while(st<=dr && v[i].p<=v[dq[dr]].p+(i-dq[dr])*s)
{
dr--;
}
dq[++dr]=i;
sum+=(v[dq[st]].p+(i-dq[st])*s)*v[i].c;
}
out<<sum;
return 0;
}