Pagini recente » Cod sursa (job #676234) | Cod sursa (job #2267160) | Cod sursa (job #2725667) | Cod sursa (job #3265624) | Cod sursa (job #3199901)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
const int max_G = 1001;
const int max_W = 5001;
const int bigNumber = 1e9;
int c_eng[max_W];
int EG[max_G];
int CG[max_G];
int main() {
int G, W;
f >> G >> W;
for (int i = 0; i < G; i++) {
f >> EG[i] >> CG[i];
}
for (int i = 0; i <= W; i++) {
c_eng[i] = bigNumber;
}
c_eng[0] = 0;
for (int i = 0; i < G; i++) {
for (int j = EG[i]; j <= W; j++) {
c_eng[j] = min(c_eng[j], c_eng[j - EG[i]] + CG[i]);
}
}
if (c_eng[W] == bigNumber) {
g << "-1";
} else {
g << c_eng[W];
}
f.close();
g.close();
return 0;
}