Pagini recente » Cod sursa (job #397721) | Cod sursa (job #1654092) | Cod sursa (job #568041) | Cod sursa (job #1120470) | Cod sursa (job #1000744)
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w[10001], p[10001], g, n, i, cw, d[5001][10001];
int main() {
fin >> n >> g;
for (i = 1; i <= n; i++)
fin >> w[i] >> p[i];
for (i = 1; i <= n; i++)
for (cw = 0; cw <= g; cw++){
d[i][cw] = d[i - 1][cw];
if (w[i] <= cw)
d[i][cw] = max(d[i][cw], d[i - 1][cw - w[i]] + p[i]);
}
fout << d[n][g];
}