Pagini recente » Cod sursa (job #1099843) | Cod sursa (job #2525871) | Cod sursa (job #2278302) | Cod sursa (job #2985909) | Cod sursa (job #2046212)
#include <fstream>
using namespace std;
ifstream cin("branza.in");
ofstream cout("branza.out");
const int DIM = 5000001;
long long d[DIM], v[DIM], c[DIM];
int main()
{
int n, s, t;
cin >> n >> s >> t;
long long sum = 0;
int st = 0, dr = -1;
for(int i = 0; i < n; ++i)
{
cin >> v[i] >> c[i];
if(st <= dr && d[st] == i - t)
{
++st;
}
while(st <= dr && v[i] <= v[d[dr]] + s * (i - d[dr]))
{
--dr;
}
d[++dr] = i;
sum += c[i] * (v[d[st]] + s * (i - d[st]));
}
cout << sum;
return 0;
}