Pagini recente » Cod sursa (job #765437) | Cod sursa (job #3155927) | Borderou de evaluare (job #520031) | Cod sursa (job #1088962) | Cod sursa (job #2408518)
#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)
{
a[j + w[i]] = max(a[j] + p[i], a[j + w[i]]);
MAX = max(MAX, a[j + w[i]]);
}
}
out << MAX;
return 0;
}