Cod sursa(job #2493176)
Utilizator | Data | 16 noiembrie 2019 09:25:34 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int n, g, w, p;
int dp[10005];
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 j=g; j>=w; j--)
dp[j]=max(dp[j], dp[j-w]+p);
}
printf("%d", dp[g]);
return 0;
}