Cod sursa(job #1368480)
Utilizator | Data | 2 martie 2015 17:56:23 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, w, m[5001],c[5001], V[5001][5001];
int main()
{
f>>n>>w;
for(int i=1;i<=n;i++)
{f>>m[i]>>c[i];}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=w;j++)
{
if(j<m[i]) V[i][j]=V[i-1][j];
else V[i][j]=max(V[i-1][j],V[i-1][j-m[i]]+c[i]);
}
}
g<<V[n][w];
return 0;
}