Pagini recente » Cod sursa (job #613529) | Cod sursa (job #1127162) | Cod sursa (job #866198) | Cod sursa (job #1366394) | Cod sursa (job #1970004)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, w, i, j, a, b;
int sol[10005];
int main() {
f >> n >> w;
sol[0] = 1;
for (i = 1; i <= n; i++) {
f >> a >> b;
for (j = w; j >= a; j--)
if (sol[j-a]+b > sol[j] && sol[j-a] != 0) sol[j] = sol[j-a]+b;
}
int max1 = 0;
for (i = 1; i <= w; i++)
max1 = max(max1, sol[i]);
g << max1-1;
}