Pagini recente » Cod sursa (job #980925) | Cod sursa (job #2604614) | Cod sursa (job #1501926) | Cod sursa (job #2869226) | Cod sursa (job #2205693)
#include <fstream>
using namespace std;
ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");
int dp[10005];
int main()
{
int n,G,g,i,j,ef,maxi=0,maxp=0;
cin>>n>>G;
for (i=1;i<=n;i++)
{
cin>>g>>ef;
for (j=maxi;j>=1;j--)
{
if (j+g<=G&&dp[j]!=0)
{
dp[j+g]=max(dp[j+g],dp[j]+ef);
maxi=max(maxi,j+g);
if (dp[j+g]>maxp)
maxp=dp[j+g];
}
}
dp[g]=max(dp[g],ef);
if (dp[g]>maxp)
maxp=dp[g];
maxi=max(maxi,g);
}
cout<<maxp;
return 0;
}