Cod sursa(job #904322)
Utilizator | Data | 4 martie 2013 08:40:45 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,g,act=0;
int v[2][10010];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>n>>g;
int x,c,p;
while(n)
{
fin>>c>>p;
for(int i=c;i<=g;i++)
v[act][i]=max(v[!act][i],v[!act][i-c]+p);
act=!act;
n--;
}
fout<<v[!act][g];
return 0;
}