Pagini recente » Cod sursa (job #2867555) | Cod sursa (job #393028) | Cod sursa (job #2819334) | Cod sursa (job #148016) | Cod sursa (job #979119)
Cod sursa(job #979119)
#include<stdio.h>
#include<algorithm>
#include<cstring>
#define maxn 5005
#define maxg 10005
using namespace std;
int n,g;
int w[maxn],p[maxn];
int s[maxg];
void read()
{
scanf("%d%d",&n,&g);
for(int i=1;i<=n;i++) scanf("%d%d",&w[i],&p[i]);
}
void solve()
{
int i,j;
for(i=1;i<=n;i++)
for(j=g;j>=0;j--)
if(j-w[i]>=0 && s[j-w[i]]+p[i]>s[j]) s[j]=s[j-w[i]]+p[i];
}
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
read();
solve();
printf("%d",s[g]);
fclose(stdin);
fclose(stdout);
return 0;
}