Cod sursa(job #920258)
Utilizator | Florian Raul Raulr100 | Data | 20 martie 2013 09:49:51 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <stack>
using namespace std;
int w[101],p[101],a[101][101],N,G;
int maxim(int a, int b)
{
if(a>b)
return a;
return b;
}
int main()
{
cin >> N >> G;
int i,g;
for(i=1; i<=N; ++i)
cin >> w[i] >> p[i];
for(i=1; i<=N; ++i)
for(g=1; g<=G; ++g)
{
a[i][g]=a[i-1][g];
if(w[i]<=g)
a[i][g]=max(a[i][g],a[i-1][g-w[i]]+p[i]);
}
cout << a[N][G];
return 0;
}