Cod sursa(job #1377847)
| Utilizator | Data | 6 martie 2015 08:37:04 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int N,G,v[10001],w[10001],m[10001][10001];
int main()
{
in>>N>>G;
for(int i=1;i<=N;i++)
{
in>>w[i]>>v[i];
}
for(int i=1;i<=N;i++)
{
for(int j=0;j<=G;j++)
{
if(w[i]<=j)
{
m[i][j]=max(m[i-1][j], m[i-1][j-w[i]]+v[i]);
}
else
{
m[i][j]=m[i-1][j];
}
}
}
out<<m[N][G];
return 0;
}
