Pagini recente » Cod sursa (job #422152) | Cod sursa (job #1955239) | Cod sursa (job #1907885) | Cod sursa (job #2467912) | Cod sursa (job #3247965)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int w[100], p[100];
int Optim[100];
int main()
{
int n, ge, sol = 0;
f >> n >> ge;
for(int i = 1; i <= n; i++)
f >> w[i] >> p[i];
for(int i = 1; i <= n; i++)
for(int j = ge - w[i]; j >= 0; j--)
if(Optim[j + w[i]] < Optim[j] + p[i])
{
Optim[j + w[i]] = Optim[j] + p[i];
if(Optim[j + w[i]] > sol)
sol = Optim[j + w[i]];
}
g << sol;
return 0;
}