Cod sursa(job #799285)
Utilizator | Data | 18 octombrie 2012 15:56:15 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream fout("rucsac.out");
int n,g,p[5005],w[5005],cost[2][10005],l;
int main()
{
f>>n>>g;
int i;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++,l=1-l)
for(int c=0;c<=g;c++)
{
cost[1-l][c]=cost[l][c];
if(w[i]<=c)
cost[1-l][c]=max(cost[1-l][c],cost[l][c-w[i]]+p[i]);
}
fout<<cost[l][g]<<'\n';
f.close();
fout.close();
return 0;
}