Cod sursa(job #2373583)
Utilizator | Data | 7 martie 2019 14:23:45 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
int dp[10005];
int main(){
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,g;
scanf("%d %d",&n,&g);
for(int i=1;i<=n;++i){
int w,p;
scanf("%d %d",&w,&p);
for(int j=g;j>=w;--j)
dp[j]=max(dp[j],dp[j-w]+p);
}
printf("%d\n",dp[g]);
return 0;
}