Pagini recente » Cod sursa (job #2710118) | Cod sursa (job #2884544) | Cod sursa (job #3246348) | Cod sursa (job #2572469) | Cod sursa (job #1954157)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int DIMN = 5001, DIMG = 10001;
int N, G;
int g[DIMN], v[DIMN];
bool s[DIMG];
int w[DIMG];
int main()
{
fin >> N >> G;
for ( int i = 1; i <= N; i++ )
fin >> g[i] >> v[i];
s[0] = true;
for ( int i = 1; i <= N; i++ )
for ( int j = G - g[i]; j >= 0; j-- )
if ( w[j + g[i]] < w[j] + v[i] && s[j]) {
w[j + g[i]] = w[j] + v[i];
s[j + g[i]] = true;
}
int m = 0;
for ( int i = 1; i <= G; i++)
m = max(m, w[i]);
fout << m << '\n';
fin.close();
fout.close();
return 0;
}