Cod sursa(job #2505762)
Utilizator | Data | 7 decembrie 2019 10:49:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,gr;
int g[5001],p[10001];
int dp[5001][10001];
void citire()
{
fin>>n>>gr;
for(int i=1;i<=n;i++)
fin>>g[i]>>p[i];
}
void construire_matrice()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=gr;j++)
{
if(g[i]<=j)
dp[i][j]=max(dp[i-1][j],dp[i-1][j-g[i]]+p[i]);
}
}
fout<<dp[n][gr]<<"\n";
}
int main()
{
citire();
construire_matrice();
return 0;
}