Cod sursa(job #3367925)
| Utilizator | Data | 12 octombrie 2026 11:53:53 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
int n,k,g,p,i,j,dp[10005];
int main()
{
cin >> n >> k;
for (i=1; i<=n; i++)
{
cin >> g >> p;
for (j=k; j>=g; j--)
{
if (dp[j-g] + p > dp[j])
dp[j]=dp[j-g] + p;
}
}
cout << dp[k];
return 0;
}
