Cod sursa(job #1536676)
Utilizator | Data | 26 noiembrie 2015 15:19:40 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, i, j;
int a[5001][10001];
int w[5001], p[5001];
int main()
{
fin >> n >> g;
for (i = 1; i <= n; i++)
fin >> w[i] >> p[i];
for (i = 1; i <= n; i++)
for (j = w[i]; j <= g; j++)
a[i][j] = max(a[i-1][j], a[i-1][j-w[i]]+p[i]);
fout << a[n][g];
return 0;
}