Pagini recente » Cod sursa (job #2507675) | Cod sursa (job #1792652) | Cod sursa (job #3176845) | Cod sursa (job #1168624) | Cod sursa (job #2317811)
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int a[10001], w[5001], p[5001];
int main()
{
int n, G, MAX = 0;
in >> n >> G;
for (int i = 1; i <= n; ++i)
in >> w[i] >> p[i];
for (int i = 1; i <= n; ++i)
{
for (int j = G - w[i]; j >= 0; --j)
{
if (a[j + w[i]] < a[j] + p[i])
a[j + w[i]] = a[j] + p[i];
if (a[j + w[i]] > MAX)
MAX = a[j + w[i]];
}
}
out << MAX;
return 0;
}