Pagini recente » Cod sursa (job #333540) | Cod sursa (job #1291115) | Cod sursa (job #1424676) | Cod sursa (job #649145) | Cod sursa (job #2063808)
#include <fstream>
int d[100000], st = 0, dr = -1, v[100000];
int main() {
std::ifstream in("branza.in");
std::ofstream out("branza.out");
int n, s, t, c, r = 0;
in >> n >> s >> t;
for (int i = 0; i < n; ++i) {
in >> v[i] >> c;
if (i - d[st] > t) ++st;
while (dr > st && v[d[dr]] + s * (i - d[dr]) >= v[i]) --dr;
r += c * std::min(v[i], v[d[dr]] + s * (i - d[dr]));
d[++dr] = i;
}
out << r;
return 0;
}