Cod sursa(job #2286380)
| Utilizator | Data | 20 noiembrie 2018 10:25:48 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,G,g[5005],c[5005],cmax[10002];
void pd();
int main()
{
fin>>n>>G;
for(int i=1;i<=n;i++)
fin>>g[i]>>c[i];
pd();
fout<<cmax[G]<<'\n';
return 0;
}
void pd()
{
for(int i=1;i<=n;i++)
for(int x=G;x>0;--x)
if(x>=g[i])
if(cmax[x]<c[i]+cmax[x-g[i]])
cmax[x]=c[i]+cmax[x-g[i]];
}
