Pagini recente » Cod sursa (job #516806) | Cod sursa (job #1225805) | Cod sursa (job #2082031) | Cod sursa (job #1567712) | Cod sursa (job #3244283)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int w[10001],p[10001],dp[2][10001];
int main()
{
int n;
cin>>n;
int g;
cin>>g;
for(int i=1;i<=n;i++)
{
cin>>w[i]>>p[i];
}
for(int i=1;i<=n;i++)
{
int lin_cur=i%2;
int lin_ant=1-lin_cur;
for(int j=w[i];j<=g;j++)
{
dp[lin_cur][j]=max(dp[lin_ant][j],dp[lin_ant][j-w[i]]+p[i]);
}
}
cout<<dp[n%2][g]<<" ";
return 0;
}