Cod sursa(job #2567562)
| Utilizator | Data | 3 martie 2020 17:50:59 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int v[10010], n, gmax;
struct vect { int g, v;}a[5010];
int main ()
{
fin>>n>>gmax;
int i, j;
for (i=1; i<=n; i++)
fin>>a[i].g>>a[i].v;
for (i=1; i<=n; i++)
{
for (j=gmax; j>=1; j--)
{
if (j>=a[i].g)
{
if (v[j-a[i].g]+a[i].v > v[j])
v[j]=v[j-a[i].g]+a[i].v;
}
}
}
fout<<v[gmax];
}
