Pagini recente » Cod sursa (job #1341517) | Cod sursa (job #1237741) | Cod sursa (job #2808947) | Cod sursa (job #2393619) | Cod sursa (job #2191747)
#include <fstream>
using namespace std;
const int maxn = 5e3+2;
const int maxg = 1e4+2;
int n, g, w[maxn], p[maxn], M[maxn][maxg];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>n>>g;
for(int i=1; i<=n; i++)
{
fin>>w[i]>>p[i];
}
for(int i=1; i<=n; i++)
{
for(int j=0; j<=g; j++)
{
if(w[i]>j)
{
M[i][j]=M[i-1][j];
}
else
{
M[i][j]=max(M[i-1][j],M[i-1][j-w[i]]+p[i]);
}
}
}
fout<<M[n][g]<<'\n';
return 0;
}