Pagini recente » Istoria paginii info-oltenia-2018/individual/7-8 | Cod sursa (job #246020) | Cod sursa (job #2416691) | Cod sursa (job #449217) | Cod sursa (job #2570587)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, G, i, j;
int w[5001], p[5001];
int best[10001];
int rez;
int main()
{
f >> n >> G;
for (i=1; i<=n; i++)
f >> w[i] >> p[i];
for (i=1; i<=n; i++)
for (j=G-w[i]; j>=0; j--)
{
best[j+w[i]] = max(best[j+w[i]], best[j] + p[i]);
rez = max(rez, best[j+w[i]]);
}
g << rez;
return 0;
}