Pagini recente » Istoria paginii runda/abeqbq/clasament | Cod sursa (job #1645328) | Cod sursa (job #499134) | Cod sursa (job #2794451) | Cod sursa (job #1908788)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int a[5001][10001],w[5001],v[5001];
int main()
{
int n,g;
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>v[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
if(w[i]<=j)
{
a[i][j]=max(a[i-1][j], v[i]+a[i-1][j-w[i]]);
}
else
{
a[i][j]=a[i-1][j];
}
}
}
fout<<a[n][g];
return 0;
}