Cod sursa(job #2493192)
Utilizator | Data | 16 noiembrie 2019 09:33:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,dp[10005];
int gobiect[10005],profit[10005];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>gobiect[i]>>profit[i];
for(int j=g;j>=gobiect[i];j--)
{
dp[j]=max(dp[j],dp[j-gobiect[i]]+profit[i]);
}
}
fout<<dp[g];
return 0;
}