Pagini recente » Cod sursa (job #930506) | Cod sursa (job #1656904) | Cod sursa (job #1313264) | Cod sursa (job #1721461) | Cod sursa (job #2571442)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
const int N = 1e4 + 4;
int n, w, i, j, x, y, best[N];
main()
{
in >> n >> w;
for(i = 1; i <= n; i++)
{
in >> x >> y;
for(j = w - x; j >= 1; j--)
if(best[j]) best[j + x] = max(best[j + x], best[j] + y);
best[x] = max(best[x], y);
}
int ans = 0;
for(i = 1; i <= w; ++i)
ans = max(ans, best[i]);
out << ans;
return 0;
}