Pagini recente » Cod sursa (job #2364596) | Cod sursa (job #2806249) | Cod sursa (job #2024598) | Cod sursa (job #324436) | Cod sursa (job #3247964)
#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, g, sol = 0;
for(int i = 1; i <= n; i++)
f >> w[i] >> p[i];
for(int i = 1; i <= n; i++)
for(int j = g - 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;
}