Cod sursa(job #2367102)
Utilizator | Data | 5 martie 2019 08:34:15 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int v[2][10002],n,g;
int main()
{
fin>>n>>g;
for (int i=1;i<=n;i++)
{
int x,y;
fin>>y>>x;
for (int j=y;j<=g;j++)
v[i%2][j]=max(x+v[(i+1)%2][j-y],max(v[(i+1)%2][j],v[i%2][j-1]));
}
fout<<v[n%2][g];
return 0;
}