Pagini recente » Cod sursa (job #599088) | Cod sursa (job #174304) | Cod sursa (job #519454) | Cod sursa (job #2061969) | Cod sursa (job #3192606)
#include<bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G;
vector<int>weight,profit;
vector<vector<int>>dp;
int main()
{
f>>n>>G;
dp.assign(n+1,vector<int>(G+1,0));
weight.resize(n+1);
profit.resize(n+1);
for(int i=1; i<=n; i++)
f>>weight[i]>>profit[i];
for(int i=1; i<=n; i++)
for(int j=0; j<=G; j++)
{
/// we don't use object i
dp[i][j]=dp[i-1][j];
if(j>=weight[i] && 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
}
g<<dp[n][G];
return 0;
}