Cod sursa(job #2158526)
Utilizator | Data | 10 martie 2018 13:42:20 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
using namespace std;
int main()
{
int dp[10001]= {0},n,gmax;
cin>>n;
for(int i=1; i<=n; ++i)
{
int g,p;
cin>>g>>p;
for(int j=gmax; j>=g; --j)
dp[j]=max(dp[j],dp[j-g]+p);
}
cout<<dp[gmax];
return 0;
}