Pagini recente » Cod sursa (job #1464086) | Cod sursa (job #2085824) | Cod sursa (job #1520829) | Cod sursa (job #1679344) | Cod sursa (job #2733507)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int v1[5003], v2[5003];
int w[5003], p[5003];
int main ()
{
int n, i, j, gmax;
f >> n >> gmax;
for (i = 1; i <= n; i += 1)
f >> w[i] >> p[i];
for (i = 1; i <= n; i += 1)
{
for (j = 1; j <= gmax; j += 1)
{
v2[j] = v1[j];
if (w[i] <= j)
v2[j] = max (v2[j], v1[j - w[i]] + p[i]);
}
for (j = 1; j <= gmax; j += 1)
v1[j] = v2[j];
}
g << v2[gmax];
return 0;
}