Pagini recente » Cod sursa (job #525960) | Cod sursa (job #2038221) | Cod sursa (job #502639) | Cod sursa (job #1001024) | Cod sursa (job #2538211)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[10005];
bool pot[10005];
int main()
{
int n,g,w,p,rasp=-1;
cin>>n>>g;
pot[0]=1;
for(int i=1;i<=n;++i)
{
cin>>w>>p;
for(int j=g;j>=0;--j)
if(pot[j] and j+w<=g)
pot[j+w]=1,dp[j+w]=max(dp[j+w],dp[j]+p);
}
for(int i=0;i<=g;++i)
rasp=max(rasp,dp[i]);
cout<<rasp;
return 0;
}