Cod sursa(job #1411268)
Utilizator | Data | 31 martie 2015 16:22:15 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream m("rucsac.out");
int n,g,w,p,v[5100][10010],i,j;
int main()
{
f>>n>>g;
for(i=0;i<=n;i++)
v[i][0]=0;
for(i=0;i<=g;i++)
v[0][i]=0;
for(i=1;i<=n;i++)
{
f>>w>>p;
for(j=1;j<=g;j++)
{
if(j>=w)
v[i][j]=max(v[i-1][j],v[i-1][j-w]+p);
}
}
m<<v[n][g];
return 0;
}