Pagini recente » Cod sursa (job #2941473) | Cod sursa (job #1635903) | Cod sursa (job #591152) | Cod sursa (job #1329116) | Cod sursa (job #1024487)
#include <cstdio>
#include <algorithm>
using namespace std;
int v[10000],w[10000];
int main(){
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,g,we,p;
int i,j;
scanf("%d%d",&n,&g);
for(i=1;i<=n;i++){
scanf("%d%d",&we,&p);
for(j=1;j<=g;j++){
if(we>j){
v[j]=w[j];
}else{
v[j]=max(w[j],w[j-we]+p);
}
}
for(j=1;j<=g;j++){
w[j]=v[j];
}
}
printf("%d",v[g]);
return 0;
}