Cod sursa(job #2716108)
| Utilizator | Data | 4 martie 2021 18:41:45 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout("rucsac.out");
int n,G,w[5009],p[5009];
int dp[5009][10009];
int32_t 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=0;j<=G;j++){
if(w[i]<=j)
dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+p[i]);
else
dp[i][j]=dp[i-1][j];
}
fout<<dp[n][G];
}
