Cod sursa(job #3364558)
| Utilizator | Data | 5 septembrie 2026 15:18:56 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,w[5005],p[5005],dp[5005];
int main()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
{
fin>>w[i]>>p[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
dp[j]=max(dp[j],dp[j-w[i]]+p[i]);
}
}
fout<<dp[n][g];
return 0;
}
