Cod sursa(job #1896246)
Utilizator | Data | 28 februarie 2017 16:14:39 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int w[1000],v[1000],m[1000][1000],n,W,i,j;
int main()
{
f>>n>>W;
for(i=1;i<=n;i++)
f>>w[i]>>v[i];
for (i=1;i<=n;i++)
for(j=0;j<=W;j++)
if (w[i]>j)
m[i][j]=m[i-1][j];
else
m[i][j]= max(m[i-1][j],m[i-1][j-w[i]]+v[i]);
g<<m[n][W];
return 0;
}