Cod sursa(job #2286386)
Utilizator | Data | 20 noiembrie 2018 10:27:22 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
#define NMAX 5004
#define GMAX 10002
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, G, g[NMAX], c[NMAX], cmax[GMAX];
void citire()
{
int i;
fin >>n>>G;
for (i=1; i<=n; i++) fin >>g[i]>> c[i];
}
void pd()
{
int i,x;
for (i=1; i<=n; i++)
for (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]];
}
int main()
{
citire();
pd();
fout <<cmax[G]<<'\n';
fout.close();
return 0;
}