Pagini recente » Cod sursa (job #40374) | Cod sursa (job #2422813) | Cod sursa (job #2562859) | Cod sursa (job #1717318) | Cod sursa (job #1536679)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, i, j;
int a[5001][10001];
short 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;
}