Pagini recente » Cod sursa (job #2113242) | Cod sursa (job #819946) | Cod sursa (job #2887360) | Cod sursa (job #1852215) | Cod sursa (job #2044531)
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int a[1005][1005];
int w[10001],p[10001];
int main()
{
int N,G,i,j,Pmax=0;
fin>>N>>G;
for(i=1; i<=N; i++)
{
fin>>w[i]>>p[i];
}
for(i=1; i<=N; i++)
{
for(j=1; j<=G; j++)
{
a[i][j]=a[i-1][j];
if(w[i]<=j)
{
a[i][j]=max(a[i-1][j],a[i-1][j-w[i]]+p[i]);
}
}
}
Pmax=a[N][G];
fout<<Pmax;
fin.close();
fout.close();
return 0;
}