Pagini recente » Cod sursa (job #2349974) | Cod sursa (job #2107801) | Cod sursa (job #1543786) | Cod sursa (job #1227165) | Cod sursa (job #2617935)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int v[10001];
int main()
{
int G, n, i, j, g_obiect, pret, maxx, gmax, k;
fin >> n >> G;
for(i=1;i<=n;i++)
{
fin >> g_obiect >> pret;
for(j=G-g_obiect ; j>0 ; j--)
{
if(v[j]>0)
v[j+g_obiect]=max(v[j]+pret , v[j+g_obiect]);
}
v[g_obiect]=max(pret , v[g_obiect]);
}
maxx=0;
for(i=1;i<=G;i++)
if(maxx<v[i])
{
gmax=i;
maxx=v[i];
}
fout << gmax << " " << maxx;
return 0;
}