Pagini recente » Cod sursa (job #2708337) | Cod sursa (job #1465710) | Cod sursa (job #2227922) | Cod sursa (job #494339) | Cod sursa (job #1612053)
#include <fstream>
#include <vector>
using namespace std;
ifstream is("rucsac.in");
ofstream os("rucsac.out");
int n, m, answ;
int g, p, r[10001];
int main()
{
is >> n >> m;
r[0] = 1;
for ( int i = 1; i <= n; ++i )
{
is >> g >> p;
for ( int j = min(answ, m - g); j >= 0; --j )
if ( r[j] )
{
r[j + g] = max(r[j + g], r[j] + p);
answ = max(answ, r[j + g]);
}
}
os << answ - 1;
is.close();
os.close();
return 0;
}