Cod sursa(job #763932)
Utilizator | Data | 3 iulie 2012 15:46:35 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
#define MAX 10001
int n,g,pro[MAX];
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--)pro[i] = max(pro[i],pro[i-w]+p);
}
printf("%d\n",pro[g]);
return 0;
}