Pagini recente » Cod sursa (job #586182) | Cod sursa (job #1901507) | Istoria paginii runda/oni2011_ziua2 | Cod sursa (job #1643272) | Cod sursa (job #2367125)
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int NMAX = 5000 + 5;
const int GMAX = 10000 + 5;
int N, G;
int w[NMAX], p[NMAX], dp[GMAX];
int main()
{
fin >> N >> G;
for(int i = 1; i <= N; i++)
fin >> w[i] >> p[i];
for(int i = 1; i <= N; i++)
for(int j = G; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j - w[i]] + p[i]);
fout << dp[G] << '\n';
return 0;
}