Pagini recente » Cod sursa (job #1818773) | Cod sursa (job #2050400) | Cod sursa (job #74729) | Cod sursa (job #3290896) | Cod sursa (job #2179486)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int w[5002], p[5002], optim[10002], n, g, i, j;
int main()
{
in >> n >> g;
for(i = 1; i <= n; i++) in >> w[i] >> p[i];
optim[0] = 0;
for(i = 1; i <= n; i++) {
for(j = g; j >= w[i]; j--) {
optim[j] = max(optim[j], optim[j-w[i]]+p[i]);
}
}
out << optim[g];
in.close(), out.close();
return 0;
}