Cod sursa(job #2135782)
| Utilizator | Data | 19 februarie 2018 11:00:35 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int a[10001],v[10001],i,g,gprim,vmax[10001][10001],n,gmax;
int main()
{
fin>>n>>gmax;
for(i=1; i<=n; i++)
fin>>a[i]>>v[i];
for(i=1; i<=n; i++)
for(g=1; g<=gmax; g++)
{
vmax[i][g]=vmax[i-1][g];
if(a[i]<=g && v[i]+vmax[i-1][g-a[i]]>vmax[i][g])
vmax[i][g]=v[i]+vmax[i-1][g-a[i]];
}
fout<<vmax[n][gmax];
}
