Cod sursa(job #1842128)
| Utilizator | Data | 6 ianuarie 2017 15:42:58 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <cstdio>
#include <iostream>
using namespace std;
struct rucsac{int p,g;};
rucsac v[5005];
int m[10005];
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,gmax,i,j,maxi=0;
scanf("%d%d",&n,&gmax);
gmax--;
for(i=1;i<=n;i++)
scanf("%d%d",&v[i].g,&v[i].p);
for(i=1;i<=n;i++)
for(j=gmax;j>=v[i].g;j--)
m[j]=max(m[j],m[j-v[i].g]+v[i].p);
for(i=0;i<=gmax;i++)
maxi=max(maxi,m[i]);
printf("%d",maxi);
return 0;
}
