Cod sursa(job #2135761)
Utilizator | Data | 19 februarie 2018 10:43:42 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,gmax,i,j,g[10001],v[10001],a[20001][20001];
int main()
{
fin>>n>>gmax;
for(i=1; i<=n; i++)
fin>>g[i]>>v[i];
for(int i=1; i<=n; i++)
for(int j=1; j<=gmax; j++)
if(g[i]>j)
a[i][j]=a[i-1][j];
else
a[i][j]=max(a[i-1][j],(v[i]+a[i-1][j-g[i]]));
fout<<a[n][gmax];
}