Pagini recente » Cod sursa (job #1633570) | Cod sursa (job #2459712) | Cod sursa (job #3243617) | Cod sursa (job #917459) | Cod sursa (job #2568938)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int DIM = 1e4 + 1;
int best[DIM];
main()
{
int n, w;
fin >> n >> w;
for(int i = 1; i <= n; i++)
{
int x, y;
fin >> x >> y;
for(int 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(int i = 1; i <= w; ++i)
ans = max(ans, best[i]);
fout << ans << '\n';
}