Cod sursa(job #2329483)
| Utilizator | Data | 26 ianuarie 2019 20:12:06 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int greutate[10000], pret[10000], raspuns[2][10000],i,j,n,gmax,l;
int main()
{ f>>n>>gmax;
for(i=1;i<=n;i++)
f>>greutate[i]>>pret[i];
for(i=1;i<=n;i++)
{ l=1-l;
for(j=1;j<=gmax;j++)
{ raspuns[1-l][j]=raspuns[l][j];
if(greutate[i]<=j)
raspuns[1-l][j]=max(raspuns[1-l][j],raspuns[l][j-greutate[i]]+pret[i]);
}
}
g<<max(raspuns[1-l][gmax],raspuns[l][gmax]);
return 0;
}
