Cod sursa(job #1189260)
| Utilizator | Data | 21 mai 2014 23:35:24 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
#define MAX 5005
int d[MAX];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int i,j,w,p,sol=0,n,g;
scanf("%d%d",&n,&g);
for(i=1; i<=n; i++)
{
scanf("%d %d",&w,&p);
for(j=g; j>=1; j--){
if(d[j]+p > d[j+w])
d[j+w]=d[j]+p;
if(sol < d[j+w])
sol=d[j+w];
}
}
printf("%d",sol);
return 0;
}
