Cod sursa(job #769355)
Utilizator | Data | 19 iulie 2012 01:19:10 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int n,W,i,j;
int g,p;
int a[10001], b[10001];
int main()
{
ifstream f("rucsac.in");
ofstream h("rucsac.out");
f>>n>>W;
for(i=1; i<=n; i++)
{f>>g>>p;
for(j=1; j<=W; j++)
{if(j>=g)
b[j]=max(a[j], a[j-g]+p);
else
b[j]=a[j]; }
for(j=1; j<=W; j++)
a[j]=b[j];
}
h<<b[W];
f.close();
h.close();
return 0;}