Pagini recente » Cod sursa (job #182172) | Cod sursa (job #1832812) | Cod sursa (job #2063585) | Cod sursa (job #2536420) | Cod sursa (job #3201772)
#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 costMinim = 1e9;
int c_eng[max_W+10000+2];
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];
f >> CG[i];
}
for (int i = 0; i <= max_W+10000; i++) {
c_eng[i] = bigNumber;
}
c_eng[0] = 0;
for(int i = 0; i < G; i++){
for(int j = i+1; j < G; j++){
if(EG[i] > EG[j]){
swap(EG[i], EG[j]);
swap(CG[i], CG[j]);
}
}
}
for (int i = 0; i < G; i++) {
for (int j = EG[i]; j <= W + 10000; j++) {
if (c_eng[j - EG[i]] + CG[i] < c_eng[j]) {
c_eng[j] = c_eng[j - EG[i]] + CG[i];
}
}
}
for(int i=W; i <= max_W + 10000; i++){
if(c_eng[i] < costMinim){
costMinim = c_eng[i];
}
}
if (costMinim != bigNumber) {
g << costMinim;
}
else {
g << "-1";
}
return 0;
}