Cod sursa(job #2481271)
| Utilizator | Data | 26 octombrie 2019 18:08:38 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fi ("rucsac.in");
ofstream fo ("rucsac.out");
int n,g,x,gr[5005],co[5005],a[10010],b[10010];
int main()
{
fi>>n>>g;
for(int i=1;i<=n;i++)
fi>>gr[i]>>co[i];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=g;j++)
{
if(j-gr[i]<0)
b[j]=a[j];
else b[j]=max(a[j-gr[i]]+co[i],a[j]);
}
swap(a,b);
}
fo<<a[g];
fi.close();
fo.close();
return 0;
}
