Cod sursa(job #2188697)
Utilizator | Data | 27 martie 2018 12:48:17 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gmax,v[5002],gr[5002],sol[10002];
int main()
{
f>>n>>gmax;
for(int i=1;i<=n;++i)
f>>gr[i]>>v[i];
for(int i=1;i<=n;++i)
for(int j=gmax;j>=gr[i];--j)
sol[j]=max(sol[j],sol[j-gr[i]]+v[i]);
g<<sol[gmax];
return 0;
}