Cod sursa(job #3291459)
Utilizator | Data | 4 aprilie 2025 18:55:19 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
#define pii pair<int,int>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,m,gmax,dp[3][10200],acum=1,ant;
int32_t main()
{
f>>n>>gmax;
for(int i=1; i<=n; i++)
{
int w,p;
f>>w>>p;
acum=!acum, ant=!ant;
for(int j=1; j<=gmax; j++)
{
if(j>=w)
dp[acum][j]=max(dp[ant][j],dp[ant][j-w]+p);
else
dp[acum][j]=dp[ant][j];
}
}
g<<dp[acum][gmax];
return 0;
}