Pagini recente » Cod sursa (job #2486056) | Cod sursa (job #1523731) | Cod sursa (job #2486784) | Arhiva de probleme | Cod sursa (job #2829873)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,i,j;
int v[1005][1005];
int wt[1005];
int val[1005];
int main()
{
in >>n>>g;
for (i=1;i<=n;i++)
{
in >> wt[i];
in >> val[i];
}
for (i=1;i<=n;i++)
for (j=0;j<=g;j++)
{
v[i][j]= v[i-1][j];
if (wt[i]<=j)
v[i][j]=max(val[i]+v[i-1][j-wt[i]],v[i][j]);
}
out << v[n][g];
}