Cod sursa(job #767448)
Utilizator | Data | 13 iulie 2012 15:59:26 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 10001
int b[MAX],n,g;
int main(){
int w,p;
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d",&n,&g);
while(n--)
{
scanf("%d %d",&w,&p);
for(int i=g;i-w>=0;i--) b[i] = max( b[i] , b[i-w] + p );
}
printf("%d\n",b[g]);
return 0;
}