Pagini recente » Cod sursa (job #3310484) | Cod sursa (job #724673) | Cod sursa (job #93392) | Cod sursa (job #1972022) | Cod sursa (job #967573)
Cod sursa(job #967573)
#include <fstream>
using namespace std;
int A[5000][1000];
int MAXINT = 200000000;
int main()
{
ifstream f("energii.in");
ofstream f2("energii.out");
int G, Wmin;
f>>G>>Wmin;
int w[1002];
int cost[1002];
for(int i = 0; i < G; ++i) f>>w[i]>>cost[i];
for(int i = 0; i < Wmin; ++i) A[i][0] = MAXINT;
for(int j = 0; j < G; ++j) A[0][j] = MAXINT;
for(int sum = 1; sum <= Wmin; ++sum)
{
for(int elem = 1; elem < G; ++elem)
{
if(sum - w[elem] <= 0)
A[sum][elem] = min(cost[elem], A[sum][elem-1]);
else
A[sum][elem] = min(A[sum][elem-1], cost[elem] + A[sum-w[elem]][elem-1]);
}
}
if(A[Wmin][G-1] == MAXINT) f2<<-1;
else f2<<A[Wmin][G-1];
}