Pagini recente » Cod sursa (job #711796) | Cod sursa (job #1528847) | Cod sursa (job #580144) | Cod sursa (job #1314289) | Cod sursa (job #588715)
Cod sursa(job #588715)
#include <fstream>
using namespace std;
ifstream in ("energii.in");
ofstream out ("energii.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];
}
}
}
int mmin = INF;
for (int i = w; i <= w * 2; ++i) {
if (cost[i] < mmin) {
mmin = cost[i];
}
}
out << mmin;
return 0;
}