Pagini recente » Cod sursa (job #1977747) | Cod sursa (job #1553354) | Cod sursa (job #2285771) | Cod sursa (job #1352433) | Cod sursa (job #2951280)
#include <fstream>
#define NMAX 5001
#define GMAX 10001
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int g[NMAX], cost[NMAX];
long long PretOptim[GMAX];
int main()
{
int n, G;
cin>>n>>G;
for(int i=1;i<=n;i++)
cin>>g[i]>>cost[i];
for(int i=1;i<=n;i++)
{
for(int j=G;j;j--)
{
if(j-g[i]>=0)
{
PretOptim[j]=max(PretOptim[j], PretOptim[j-g[i]]+cost[i]);
}
}
}
cout<<PretOptim[G];
return 0;
}