Cod sursa(job #2493178)
Utilizator | Data | 16 noiembrie 2019 09:27:15 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int n, g;
int dp[10005];
int w, p;
int main()
{
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
scanf("%d %d", &n, &g);
for(int i=1; i<=n; i++){
scanf("%d %d", &w, &p);
for(int i=g; i>=w; i--)
dp[i]=max(dp[i], dp[i-w]+p);
}
printf("%d", dp[g]);
return 0;
}