Pagini recente » Istoria paginii summer-challenge-2007/solutii/runda-2 | Istoria paginii preoni-2007/clasament/runda-finala/10 | Cod sursa (job #462967) | Cod sursa (job #448766) | Cod sursa (job #2775468)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("branza.in");
ofstream g("branza.out");
int main() {
long long n = 5, taxa = 10, termen = 3, pret, kg, best = 0, cost = 0, best_value;
f>>n>>taxa>>termen;
f>>pret>>kg;
cost = pret * kg;
best_value = pret;
for(int i = 1; i < n; ++i){
f>>pret>>kg;
if(i-best >= termen){
best_value = pret;
best = i;
}
if(best_value + taxa * (i-best) > pret && best != i){
best_value = pret;
best = i;
}
cost += kg * best_value + taxa * (i-best) * kg;
}
g<<cost;
return 0;
}