Pagini recente » Cod sursa (job #1316019) | Cod sursa (job #2232283) | Cod sursa (job #1705085) | Cod sursa (job #1762506) | Cod sursa (job #1875001)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G;
int main()
{
f>>n>>G;
int wt[n],val[n],a[n][G];
for(int i=1;i<=n;i++)
f>>wt[i]>>val[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=G;j++)
{
if(wt[i]>j) a[i][j]=a[i-1][j];
else a[i][j]=max(val[i]+a[i-1][j-wt[i]],a[i-1][j]);
}
g<<a[n][G];
return 0;
}