Pagini recente » Cod sursa (job #2811518) | Cod sursa (job #604974) | Cod sursa (job #1621746) | Cod sursa (job #732064) | Cod sursa (job #2500145)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream in("branza.in");
ofstream out("branza.out");
#define int long long
const int maxn = 100005;
multiset <int> diff;
int C[maxn];
int P[maxn];
int32_t main()
{
int n, S, t;
in >> n >> S >> t;
for(int i = 1; i <= n; i++)
in >> C[i] >> P[i];
int ans = 0;
for(int i = 1; i <= n; i++)
{
diff.insert(C[i] - i * S);
if(i > t)
diff.erase(C[i - t] - (i - t));
int aux = *diff.begin();
ans = ans + P[i] * (i * S + aux);
}
out << ans << "\n";
return 0;
}