Cod sursa(job #2174184)
Utilizator | Data | 16 martie 2018 11:07:33 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,p,j,i,q,a[5001][10001];
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
{f>>q>>p;
if(q<=G)
{for(j=1;j<q;j++) {a[i][j]=a[i-1][j];}
for(j=q;j<=G;j++) {a[i][j]=max(a[i-1][j],a[i-1][j-q]+p);}}
else for(j=1;j<=G;j++) a[i][j]=a[i-1][j];
}
g<<a[n][G];
return 0;
}