Cod sursa(job #2511225)
Utilizator | Data | 18 decembrie 2019 16:15:12 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,p[5005][10005],i,val,gr,j;
int main()
{
fin>>n>>g;
for(i=1; i<=n; i++)
{
fin>>gr>>val;
if(val>p[i-1][gr])
p[i][gr]=val;
for(j=1; j+gr<=g; j++)
{
p[i][j+gr]=max(p[i-1][j+gr],val+p[i-1][j]);
}
}
fout<<p[n][g];
return 0;
}