Pagini recente » Cod sursa (job #2978452) | Cod sursa (job #1564444) | Cod sursa (job #3135994) | Cod sursa (job #994320) | Cod sursa (job #2475218)
#include <bits/stdc++.h>
using namespace std;
int g,w,p[10003],e[5003],cost[5003];
ifstream in("energii.in");
ofstream out("energii.out");
void knapsack()
{
for(int i = 1; i <= w; i++)
{
p[i] = 100000000001;
}
for(int i = 1; i <= g; i++)
{
for(int j = w; j >= 0; j--)
{
if(j + e[i] > w)
{
p[w] = min(p[w],p[j]+cost[i]);
}
else
{
p[j + e[i]] = min(p[j] + cost[i],p[j+e[i]]);
}
}
}
out << p[w];
}
int main()
{
in >> g >> w;
for(int i = 1; i <= g; i++)
{
in >> e[i] >> cost[i];
}
knapsack();
return 0;
}