Cod sursa(job #2367835)
Utilizator | Ion Dragos IonDragos | Data | 5 martie 2019 12:25:12 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gg,gr[5009],pr[5009],mat[5009][5009];
int main()
{
f>>n>>gg;
for(int i=1;i<=n;i++)
{
f>>gr[i]>>pr[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=gg;j++)
{
if(gr[i]>j)
mat[i][j]=mat[i-1][j];
else
mat[i][j]=max(mat[i-1][j],mat[i-1][j-gr[i]]+pr[i]);
}
}
g<<mat[n][gg];
return 0;
}