Cod sursa(job #2329562)
| Utilizator | Data | 26 ianuarie 2019 22:38:20 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gmax,s,a[2][10001],pret[10001],greutate[10001],i,j,l;
int main()
{ f>>n>>gmax;
for(i=1;i<=n;i++)
f>>greutate[i]>>pret[i];
for(i=1;i<=n;i++)
{
l=1-l;
for(j=0;j<=gmax;j++)
{ a[1-l][j]=a[l][j];
if(greutate[i]<=j)
a[1-l][j]=max(a[1-l][j],a[l][j-greutate[i]]+pret[i]);
}
}
g<<a[1-l][gmax];
return 0;
}
