Cod sursa(job #2044526)
Utilizator | Data | 21 octombrie 2017 10:52:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n,g,m[1005][1005],gr[10005],pr[10005];
void citire()
{
fin>>n>>g;
for(int i=1;i<=n;i++)
fin>>gr[i]>>pr[i];
}
void rezolvare ()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=g;j++)
{
if(gr[i]<=j)
{
m[i][j]=max(m[i-1][j],m[i-1][j-gr[i]]+pr[i]);
}
}
fout<<m[n][g];
}
int main()
{
citire();
rezolvare();
return 0;
}