Pagini recente » Cod sursa (job #905417) | Cod sursa (job #1956182) | Cod sursa (job #550794) | Cod sursa (job #2463420) | Cod sursa (job #588709)
Cod sursa(job #588709)
#include <fstream>
using namespace std;
ifstream in ("energii.in");
ofstream out ("eneregii.out");
const int N = 1007;
const int INF = 1 << 30;
int n, cost[N * 10], e[N], c[N], w, s;
int main () {
in >> n >> w;
for (int i = 1; i <= w * 2; ++i) {
cost[i] = INF;
}
for (int i = 1; i <= n; ++i) {
in >> e[i] >> c[i];
s += e[i];
}
if (s < w) {
out << "-1";
}
for (int i = 1; i <= n; ++i) {
for (int j = w - 1; j--; ) {
if (cost[j] != INF && cost[j] + c[i] <cost[j + e[i]]) {
cost[j + e[i]]= cost[j] + c[i];
}
if (c[i] < cost[e[i]]) {
cost[e[i]] = c[i];
}
}
}
while (1) {
if (cost[w] != INF) {
out << cost[w];
return 0;
}
++w;
}
return 0;
}