Cod sursa(job #2044544)
| Utilizator | Data | 21 octombrie 2017 11:00:31 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[1005][1005];
int n,g;
int gr[1005],pr[1005];
int main()
{ fin>>n>>g;
for(int i=1;i<=n;i++)
{ fin>>gr[i]>>pr[i];
}
for(int i=1;i<=n;i++)
{ for(int j=1;j<=g;j++)
{ if(gr[i]<=j)
{ d[i][j]=max(d[i-1][j],d[i-1][j-gr[i]]+pr[i]);
}
}
}
fout<<d[n][g];
return 0;
}