Cod sursa(job #2394164)
Utilizator | Data | 1 aprilie 2019 12:52:46 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#define DIM 6000
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, G,i,j,d[10100], g[6000], p[6000],maxi;
int main()
{
fin>>n>>G;
for(i=1;i<=n;i++) fin>>g[i]>>p[i];
d[1]=0; for(i=1;i<=G;i++) d[i]=-1;
for(i=1;i<=n;i++)
for(j=G; j>=0; j--)
if(d[j]!=-1 && j+g[i]<=G)
d[j+g[i]]=max(d[j+g[i]], d[j]+p[i]), maxi= max(maxi, d[j+g[i]]);
fout<<maxi;
return 0;
}