Pagini recente » Cod sursa (job #2112671) | Cod sursa (job #1126099) | Cod sursa (job #291931) | Cod sursa (job #309715) | Cod sursa (job #2053100)
#include <fstream>
using namespace std;
ifstream cin("branza.in");
ofstream cout("branza.out");
const int nm=100005;
int n,s,t,sol[nm],d[nm],st=1,dr=0,sum=0;
struct fint
{
int c,p;
};
fint v[nm];
int main()
{
cin>>n>>s>>t;
for(int i=1;i<=n;i++)
cin>>v[i].c>>v[i].p;
for(int i=1;i<=n;i++)
{
if(st<=dr and d[st]==i-t)
st++;
while(st<=dr and v[i].c<=v[d[dr]].c+s*(i-d[dr]))
dr--;
d[++dr]=i;
sol[i]=d[st];
}
for(int i=1;i<=n;i++)
sum+=(long long)v[i].p*(v[sol[i]].c+s*(i-sol[i]));
cout<<sum;
return 0;
}