Cod sursa(job #2158547)
Utilizator | Data | 10 martie 2018 13:47:00 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int dp[10001],n,gmax;
int main()
{
f>>n>>gmax;
for(int i=1;i<=n;i++)
{
int g,p;
f>>g>>p;
for(int j=gmax;j>=g;--j)
dp[j]=max(dp[j],dp[j-g]+p);
}
g<<dp[gmax];
return 0;
}