Pagini recente » Cod sursa (job #790470) | Cod sursa (job #2642969) | Cod sursa (job #262760) | Cod sursa (job #885283) | Cod sursa (job #1384412)
#include <fstream>
#include <iostream>
using namespace std;
int a[1001][1001], n, g;
int p[5003], w[5003];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int i, j;
fin >> n >> g;
for (i = 1; i <= n; i++)
fin >> w[i] >> p[i];
for (i = 1; i <= n; i++)
for (j = 0; j <= g; j++)
{
a[i][j] = a[i-1][j];
if (w[i] <= j)
a[i][j] = max(a[i][j], a[i-1][j-w[i]] + p[i]);
}
/*for (i = 1; i <= n; i++){
for (j = 1; j <= g; j++)
cout << a[i][j] << " ";
cout << "\n";}*/
fout << a[n][g] << "\n";
return 0;
}