Cod sursa(job #651815)
Utilizator | Oncescu Costin geniucos | Data | 21 decembrie 2011 18:08:22 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
using namespace std;
int maxi,i,j,n,g,q,w,v[10001];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d",&n);
scanf("%d",&g);
for(i=1;i<=n;i++)
{
scanf("%d",&q);
scanf("%d",&w);
for(j=g;j>=1;j--)
if(v[j]>0&&j+q<=g&&v[j+q]<v[j]+w) v[j+q]=v[j]+w;
if(v[q]<w) v[q]=w;
}
for(i=g;i>=1;i--)
if(v[i]>maxi) maxi=v[i];
printf("%d\n",maxi);
return 0;
}