Pagini recente » Cod sursa (job #1335173) | Cod sursa (job #434258) | Cod sursa (job #959753) | Cod sursa (job #89152) | Cod sursa (job #1248410)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int N,G,W[100],P[100],s[100],p,Smax,Max;
int main()
{
f>>N>>G;
Smax=0;
for(int i=1; i<=N; i++)
{
f>>W[i]>>P[i];
Smax+=P[i];
}
for(int i=1; i<=Smax; i++)
s[i]=-1;
s[0]=0;
for(int i=1; i<=N; i++)
{
for(int j=G-W[i]; j>=0; j--)
if(s[j]!=-1 && s[j+W[i]] < s[j]+P[i])
{
s[j+W[i]]=s[j]+P[i];
if(s[j+W[i]]>Max)
Max=s[j+W[i]];
}
}
g<<Max;
return 0;
}