Pagini recente » Cod sursa (job #456988) | Cod sursa (job #1867776) | Cod sursa (job #415453) | Cod sursa (job #138644) | Cod sursa (job #1495031)
#include <fstream>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int n, g, da;
int w[5005], p[5005];
int c[10005], q[10005];
int maxx;
int main() {
maxx = 10000000;
fin >> n >> g;
for (int i = 1; i <= n; ++i) {
fin >> w[i] >> p[i];
}
for (int i = 1; i <= g; ++i) {
c[i] = maxx;
}
q[0] = 1;
for (int i = 0; i <= n; ++i) {
for (int j = g; j >= 0; --j) {
if (q[j] == 1) {
if (j + w[i] >= g) {
if (c[j] + p[i] < maxx) {
maxx = c[j] + p[i];
da = 1;
}
}
else {
if (c[j] + p[i] < c[j + w[i]]) {
c[j + w[i]] = c[j] + p[i];
q[j + w[i]] = 1;
}
}
}
}
}
if (da == 0) {
fout << "-1";
}
else {
if (c[g] < maxx) {
maxx = c[g];
}
fout << maxx;
}
fout.close();
return 0;
}