Cod sursa(job #2845342)
Utilizator | Data | 7 februarie 2022 18:49:40 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[10005],gr[5005],profit[5005];
int main()
{
int n,g;
cin>>n>>g;
for(int i=1;i<=n;i++)
{
cin>>gr[i]>>profit[i];
}
for(int i=1;i<=n;i++)
{
for(int j=g;j>=0;j--)
{
if(j-gr[i]>=0)
{
dp[j]=max(dp[j-gr[i]]+profit[i],dp[j]);
}
}
}
cout<<dp[g];
return 0;
}