Pagini recente » Cod sursa (job #1557982) | Cod sursa (job #2122376) | Cod sursa (job #2106463) | Cod sursa (job #56643) | Cod sursa (job #3199060)
#include <fstream>
using namespace std;
const int N = 1000;
const int W = 5001;
const int INF = 1e9;
int c[N], e[N], cost[W+1];
int main()
{
ifstream in("energii.in");
ofstream out("energii.out");
int n, w;
in >> n >> w;
for (int i = 0; i < n; i++)
{
in >> e[i] >> c[i];
}
///initializare lui cost
cost[0] = 0;
for (int j = 1; j <= w; j++)
{
cost[j] = INF;
}
for (int i = 0; i < n; i++)
{
for (int j = w - 1; j >= 0; j--)
{
if (cost[j] != INF)
{
int j_obtinut = j + e[i];
j_obtinut = min(j_obtinut, w);
cost[j_obtinut] = min(cost[j_obtinut], cost[j] + c[i]);
}
}
}
if (cost[w] == INF)
{
out << "-1\n";
}
else
{
out << cost[w] << "\n";
}
in.close();
out.close();
return 0;
}