Cod sursa(job #2280295)
Utilizator | Data | 10 noiembrie 2018 13:38:36 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#define GMAX 10005
using namespace std;
int n, g, dp[GMAX];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int n,g,w,p,i,j;
fin>>n>>g;
for(i=1; i<=n; i++)
{
fin>>w>>p;
for(j=g; j>=w; j--)
dp[j]=max(dp[j], dp[j-w]+p);
}
fout<<dp[g];
return 0;
}