Cod sursa(job #1403682)
Utilizator | Data | 27 martie 2015 15:12:27 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <algorithm>
using namespace std;
long v[10005];
int main()
{
ifstream in("rucsac.in");
ofstream out("rucsac.out");
short n, g, w, p, i, j;
in>>n>>g;
for(i=1; i<=n; ++i)
{
in>>w>>p;
for(j=g; j>=w; --j)
v[j]=max(v[j], v[j-w]+p);
}
out<<v[g];
return 0;
}