Pagini recente » Cod sursa (job #228205) | Cod sursa (job #1665132) | Cod sursa (job #2144222) | Cod sursa (job #1394627) | Cod sursa (job #2776323)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("branza.in");
ofstream fout("branza.out");
const int nmax=1e5 +7;
ll n,s,t,c,p,rasp;
deque<pair<ll,ll> > dq;
int main()
{
fin>>n>>s>>t;
for(int i=1; i<=n; i++)
{
fin>>c>>p;
while(!dq.empty() && dq.back().first+(i-dq.back().second)*s>c) dq.pop_back();
dq.push_back({c,i});
if(i-dq.front().second>t) dq.pop_front();
rasp+=(dq.front().first+(i-dq.front().second)*s)*p;
}
fout<<rasp;
return 0;
}