Cod sursa(job #3187531)
| Utilizator | Data | 29 decembrie 2023 13:08:00 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <algorithm>
#define nmax 5001
#define cmax 10001
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int dp[nmax][cmax], g[nmax], c[nmax], n, m;
int main()
{
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>g[i]>>c[i];
/// dinamica rucsac
for(int i=1; i<=n; i++)
{
for(int j=0; j<=cmax; j++)
{
if(j<g[i])
dp[i][j]=dp[i-1][j];
else
dp[i][j] = max(dp[i-1][j], dp[i-1][j-g[i]]+c[i]);
}
}
cout<<dp[n][m];
}
