Pagini recente » Cod sursa (job #2234266) | Cod sursa (job #1759367) | Cod sursa (job #2379106) | Cod sursa (job #838967) | Cod sursa (job #1739042)
#include <iostream>
#include <cstdio>
#define NMAX 5005
#define GMAX 10005
using namespace std;
int N,G;
int g[NMAX];
int p[NMAX];
int dp[GMAX];
void citire()
{
scanf("%d%d",&N,&G);
for(int i=1;i<=N;i++)
scanf("%d%d",&g[i],&p[i]);
}
void rezolvare()
{
for(int i=g[1];i<=G;i++)
dp[i]=p[1];
for(int i=2;i<=N;i++)
{
for(int j=G;j>=g[i];j--)
if(dp[j]<p[i]+dp[j-g[i]])
dp[j]=p[i]+dp[j-g[i]];
}
}
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
citire();
rezolvare();
cout<<dp[G];
return 0;
}