Cod sursa(job #904327)
Utilizator | Data | 4 martie 2013 09:01:23 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,g,act=0;
int v[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=g-c;i>=0;i--)
if(v[i])
v[i+c]=max(v[i+c],v[i]+p);
v[c]=max(v[c],p);
act=!act;
n--;
}
fout<<v[g];
return 0;
}