Cod sursa(job #1786044)
Utilizator | Data | 22 octombrie 2016 11:48:11 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
int N,G,g,v,a[50001];
#define max(x,y) ((x>y)?x:y)
void dp()
{
scanf("%d %d",&N,&G);
for(int i=0;i<N;i++)
{
scanf("%d %d ",&g,&v);
for(int j = G ;j >= g; j--)
a[j]=max(a[j],a[j-g]+v);
}
printf("%d",a[G]);
}
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
dp();
return 0;
}