Pagini recente » Cod sursa (job #1908736) | Cod sursa (job #745209) | Cod sursa (job #3030570) | Cod sursa (job #3032527) | Cod sursa (job #1047284)
#include<fstream>
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int G,Gr[10001],C[10000],n,Castig[10001],Best[10001],i,j;
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
f>>Gr[i]>>C[i];
for(i=1;i<=n;i++)
for(j=G;j>=1;j--)
if(Gr[i]<=j)
if(Castig[j]<Castig[j-Gr[i]]+C[i])
{
Castig[j]=Castig[j-Gr[i]]+C[i];
Best[j]=i;
}
j=G;
g<<Castig[G]<<endl;
/*while(Best[j])
{
g<<Best[j]<<" "<<Gr[Best[j]]<<" "<<C[Best[j]]<<endl;
j-=Gr[Best[j]];
}*/
return 0;
}