Cod sursa(job #2485687)
Utilizator | Muresan Sabina muresan_sabina | Data | 1 noiembrie 2019 21:31:47 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int v1[5005], v2[5005], n, G;
int main()
{
int i, j, g[5005], val[5005];
fin>>n>>G;
for(i=1;i<=n;i++)
{
fin>>g[i]>>val[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=G;j++)
{
if(j>=g[i])
{
v1[j]=max(v2[j-g[i]]+val[i], v2[j]);
}
else
{
v1[j]=v2[j];
}
}
swap(v1,v2);
}
fout<<v2[G];
fin.close();
fout.close();
return 0;
}