Cod sursa(job #2562930)
Utilizator | Data | 29 februarie 2020 20:14:37 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int m[5001][10001];
int main()
{
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int v[5001],c[5001];
int g,n;
fin>>n>>g;
for(int i=1; i<=n; i++)
{
fin>>v[i]>>c[i];
for(int j=1; j<=g; j++)
if(v[i]<=j)
m[i][j]=max(m[i-1][j-v[i]]+c[i],m[i-1][j]);
}
fout<<m[n][g];
return 0;
}