Pagini recente » Cod sursa (job #2212149) | Rating Stefan Mihai (mihaistefan2002) | Cod sursa (job #2393546) | Cod sursa (job #421888) | Cod sursa (job #1649446)
#include <cstdio>
#include <algorithm>
using namespace std;
int d[10010];
int main()
{
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
int n,m,sol=0,a,s;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&a,&s);
for(int j=m-a;j>=0;j--) d[j+a]=max(d[j+a],d[j]+s);
}
for(int i=0;i<=m;i++) sol=max(sol,d[i]);
printf("%d",sol);
return 0;
}