Pagini recente » Cod sursa (job #2614339) | Cod sursa (job #1459961) | Cod sursa (job #851017) | Cod sursa (job #2248349) | Cod sursa (job #3184195)
#include <iostream>
#include <cmath>
using namespace std;
struct obiect{
int g, v;
}v[1005];
int dp[10005][10005];
int main()
{
int n,Gmax;
cin>>n>>Gmax;
for(int i=1;i<=n;i++)
cin>>v[i].g>>v[i].v;
dp[1][1]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=Gmax;j++){
if(j-v[i].g>=0)
dp[i][j]=max(dp[i-1][j-v[i].g]+v[i].v, dp[i-1][j]);
else
dp[i][j]=dp[i-1][j];
}
cout<<dp[n][Gmax];
return 0;
}