Cod sursa(job #813276)
| Utilizator | Data | 15 noiembrie 2012 09:00:34 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
#define Vmax 10010
int gr[Vmax], c[Vmax],best[Vmax],n, gv,j,i;
int main()
{
f>>n>>gv;
for(i=1; i<=n; i++)
f>>gr[i]>>c[i];
for(i=1; i<=n; i++)
for(j=gv-gr[i]; j>=0; j--)
best[j+gr[i]]=max(best[j+gr[i]], best[j]+c[i]);
g<<best[gv];
return 0;
}
