Cod sursa(job #2587531)
| Utilizator | Data | 22 martie 2020 21:05:12 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int nmax=5005;
const int gmax=10005;
int n,g;
int w[nmax],p[nmax],dp[nmax][gmax];
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[i][j]=dp[i-1][j];
if(w[i]<=j)
dp[i][j]=max(dp[i][j],dp[i-1][j-w[i]]+p[i]);
}
fout<<dp[n][g];
return 0;
}
