Cod sursa(job #1586902)
Utilizator | Data | 1 februarie 2016 18:33:10 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
int n,g;
int w,p;
int i,j;
int c[10001];
int main()
{
fi>>n>>g;
for (i=1;i<=n;i++)
{fi>>w>>p;
for (j=g;j>=0;j--)
if (w<=j) c[j]=max(c[j],c[j-w]+p);
}
fo<<c[g];
return 0;
}