Pagini recente » Cod sursa (job #2811959) | Cod sursa (job #2971518) | Cod sursa (job #769540) | Cod sursa (job #2102957) | Cod sursa (job #820639)
Cod sursa(job #820639)
#include<cstdio>
using namespace std;
const int N=100;
int g[N],p[N],prf[1000],n,gt;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d%d",&n,>);
for(int i=1;i<=n;i++)
scanf("%d%d",&g[i],&p[i]);
for(int j=1;j<=gt;j++) prf[j]=-1;
prf[0]=0;
for (int i=1;i<=n;i++)
{
for(int j=gt-g[i];j>=0;j--)
if (prf[j]!=-1 && prf[j]+p[i]>prf[j+g[i]])
prf[j+g[i]]=prf[j]+p[i];
}
int max=-1;
for(int j=1;j<=gt;j++)
if (prf[j]>max) max=prf[j];
printf("%d",max);
return 0;
}