Pagini recente » Borderou de evaluare (job #758412) | Cod sursa (job #535505) | Borderou de evaluare (job #1662415) | Borderou de evaluare (job #1738406) | Cod sursa (job #3182265)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,G;
int dp[3][10001];
int main()
{
cin >> n >> G;
for(int i=1;i<=n;i++)
{
int g,p;
cin >> g >> p;
for(int j=0;j<=G;j++)
if(g<=j)
if(i%2)
dp[2][j]=max(dp[1][j],dp[1][j-g]+p);
else
dp[1][j]=max(dp[2][j],dp[2][j-g]+p);
}
if(n%2)
cout << dp[2][G];
else
cout << dp[1][G];
return 0;
}