Cod sursa(job #1818554)
| Utilizator | Data | 29 noiembrie 2016 13:45:59 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
#include <fstream>
int n,G,c[10001][10001];
struct obiect
{ int c,g;};
obiect a[10001];
void citire()
{ int i;
fin>>n>>G;
for(i=1; i<=n; ++i)
{fin>>a[i].g;
fin>>a[i].c;
}
}
void dinamica()
{ int i,j;
for(i=1; i<=n; ++i)
for(j=G; j>=1; --j)
if(a[i].g>j) c[i][j]=c[i-1][j];
else c[i][j]=max(c[i-1][j],a[i].c+c[i-1][j-a[i].g]);
fout<<c[n][G];
}
int main()
{ citire();
dinamica();
return 0;
}
