Pagini recente » Cod sursa (job #1429668) | Cod sursa (job #2673203) | Cod sursa (job #688169) | Cod sursa (job #1847690) | Cod sursa (job #3192607)
#include<bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,ans;
vector<int>weight,profit;
vector<vector<int>>dp;
int main()
{
f>>n>>G;
dp.assign(n+1,vector<int>(G+1,-1));
weight.resize(n+1);
profit.resize(n+1);
for(int i=1; i<=n; i++)
f>>weight[i]>>profit[i];
dp[0][0]=0;
for(int i=1; i<=n; i++)
for(int j=0; j<=G; j++)
{
if(dp[i-1][j]>=0)
dp[i][j]=dp[i-1][j]; /// we don't use object i
if(j>=weight[i] && dp[i-1][j-weight[i]]>=0 && dp[i-1][j-weight[i]]+profit[i]>dp[i][j])
dp[i][j]=dp[i-1][j-weight[i]]+profit[i]; /// we use object i
}
for(int i=1;i<=G;i++)
ans=max(ans,dp[n][i]);
g<<ans;
return 0;
}