Cod sursa(job #2956900)
| Utilizator | Data | 21 decembrie 2022 00:27:04 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
int v[5010];
int w[5010];
int d[5010][10010];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, wt;
f>>n>>wt;
for(int i = 1; i<=n; i++)
{
f>>w[i];
f>>v[i];
}
for(int i = 1; i<=n; i++)
{
for(int j = 0; j<=wt; j++)
{
if(w[i] <= j)
{
d[i][j] = max(v[i] + d[i-1][j-w[i]], d[i-1][j]);
}
else
{
d[i][j] = d[i-1][j];
}
}
}
g<<d[n][wt];
return 0;
}
