Cod sursa(job #2334132)
Utilizator | Data | 2 februarie 2019 11:29:11 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int d[3][10000];
int n, G;
int w[5000], p[5000];
int main()
{
f>>n>>G;
for(int i=1; i<=n; i++)
f>>w[i]>>p[i];
for(int i=1; i<=n; i++)
{
for(int j=w[i]; j<=G; j++)
{
d[i%2][j] = max(d[(i+1)%2][j-w[i]]+p[i], d[(i+1)%2][j]);
}
}
g<<d[n%2][G];
return 0;
}