Cod sursa(job #2049849)
| Utilizator | Data | 27 octombrie 2017 18:33:23 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int a[5005], b[5005], mat[3][10005];
int main()
{
int n, g;
in>> n >> g;
for(int i=1; i<=n; i++)
{
in>>a[i]>>b[i];
}
for(int i=1; i<=n; i++)
{
int m=i%2;
for(int j=1; j<=g; j++)
{
mat[m][j]=mat[1-m][j];
if(a[i]<=j)
mat[m][j]=max(mat[1-m][j], mat[1-m][j-a[i]]+b[i]);
}
}
out << mat[n%2][g];
return 0;
}
