Pagini recente » Cod sursa (job #2537810) | Cod sursa (job #2777021) | Cod sursa (job #2914037) | Cod sursa (job #2909783) | Cod sursa (job #3231151)
#include <bits/stdc++.h>
using namespace std;
int main() {
freopen("branza.in", "r", stdin);
freopen("branza.out", "w", stdout);
int n, s, t;
cin >> n >> s >> t;
vector<vector<int>> v(n, vector<int>(2));
for(int i = 0;i < n;++i)
cin >> v[i][0] >> v[i][1];
uint64_t ans = 0;
deque<int> q;
for(int i = 0;i < n;++i)
{
if(!q.empty() && i - q.front() > t)
q.pop_front();
while(!q.empty() && v[i][0] < (i - q.front()) * s + v[q.front()][0])
q.pop_front();
q.push_back(i);
ans += (v[q.front()][0] + (i - q.front()) * s) * (uint64_t) v[i][1];
}
cout << ans << "\n";
}