Cod sursa(job #2174056)
Utilizator | Data | 16 martie 2018 10:34:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
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,w[10002],p[10002],a[5002][10002];
int main()
{
int i,j;
f>>n>>G;
for(i=1;i<=n;i++) f>>w[i]>>p[i];
for(i=1;i<=n;i++)
for(j=1;j<=G;j++)
if(w[i]<=j)
a[i][j]=max(a[i-1][j],(a[i-1][j-w[i]]+p[i]));
g<<a[n][G]<<'\n';
f.close();
g.close();
return 0;
}