Cod sursa(job #825797)
Utilizator | Data | 29 noiembrie 2012 16:51:05 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<cstdio>
#define max(a,b) (a>b)?a:b
#define gmax 10005
using namespace std;
int n,g,best[gmax],c,p,j;
inline void rucsac()
{
scanf("%d %d",&c,&p);
for(j=g-c;j>=0;j--)
best[j+c]=max(best[j]+p,best[j+c]);
}
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
scanf("%d %d",&n,&g);
for(int i=0;i<n;i++)
rucsac();
printf("%d\n",best[g]);
return 0;
}