Pagini recente » Cod sursa (job #2511169) | Cod sursa (job #2149035) | Cod sursa (job #2262697) | Cod sursa (job #2315035) | Cod sursa (job #2069530)
#include <iostream>
#include <stdio.h>
using namespace std;
int a[5005][10005], n, gmax, pmax=0;
struct obiect
{
int v;
int g;
}v[5005];
int main()
{
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
cin>>n>>gmax;
for(int i=1; i<=n; i++)
scanf("%d %d \n", &v[i].g, &v[i].v);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=gmax; j++)
{
a[i][j]=a[i-1][j];
if(j-v[i].g>=0)
a[i][j]=max(a[i][j],a[i-1][j-v[i].g]+v[i].v);
}
}
cout<<a[n][gmax];
return 0;
}