Pagini recente » Cod sursa (job #2509515) | Cod sursa (job #2190103) | Cod sursa (job #2031093) | Cod sursa (job #1146750) | Cod sursa (job #3245336)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[2][10001];
int main()
{
int n,m,i,j,rasp=0,a,b;
cin>>n>>m;
for(j=1;j<=m;j++){
dp[0][j]=-1;
}
for(i=1;i<=n;i++){
cin>>a>>b;
for(j=1;j<=m;j++){
dp[1][j]=dp[0][j];
if(j>=a && dp[0][j-a]!=-1) dp[1][j]=max(dp[1][j],dp[0][j-a]+b);
}
for(j=1;j<=m;j++){dp[0][j]=dp[1][j];dp[1][j]=0;}
}
for(i=0;i<=m;i++) rasp=max(rasp,dp[0][i]);
cout<<rasp;
return 0;
}