Cod sursa(job #2158543)
Utilizator | Data | 10 martie 2018 13:46:11 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
//dp[i][cap]=pt primele i obiecte si capacitate cap
int dp[10001],n,gmax,i,j;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
in>>n>>gmax;
for(i=1;i<=n;i++)
{
int g,p;
in>>g>>p;
for(j=gmax;j>=g;j--) dp[j]=max(dp[j],dp[j-g]+p);
}
out<<dp[gmax];
return 0;
}