Pagini recente » Cod sursa (job #1498719) | Cod sursa (job #1340777) | Cod sursa (job #1919359) | Cod sursa (job #889191) | Cod sursa (job #2722715)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,w[10000],p[10000],dp[5001][10001],Pmax;
int main()
{
in>>n>>g;
for(int i=1;i<=n;i++)
in>>w[i]>>p[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=g;j++)
if(j>=w[i])
dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+p[i]);
else
dp[i][j]=dp[i-1][j];
for(int i=1;i<=g;i++)
Pmax=max(Pmax,dp[n][i]);
out<<Pmax;
return 0;
}