Pagini recente » Cod sursa (job #2470158) | Cod sursa (job #1862003) | Cod sursa (job #2182842) | Cod sursa (job #1217503) | Cod sursa (job #1171774)
#include <iostream>
#include <cstdio>
using namespace std;
int p[1007],c[1007],d[1007][1007],n,g;
int main(){
int i,j;
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
scanf("%d%d",&n,&g);
for(i=1;i<=n;i++)
scanf("%d%d",&p[i],&c[i]);
for(i=1;i<=n;i++)
for(j=1;j<=g;j++)
{
d[i][j]=d[i-1][j];
if(p[i]<=j)
d[i][j] = max(d[i][j],d[i-1][j-p[i]]+c[i]);
}
printf("%d\n",d[n][g]);
return 0;
}