Cod sursa(job #2194334)
Utilizator | Data | 12 aprilie 2018 22:14:53 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream gout("rucsac.out");
int n,G,i,g[5010],p[5010],optim[10011],j;
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
f>>g[i]>>p[i];
optim[0]=0;
for(i=1;i<=n;i++)
for(j=G;j>=g[i];j--)
if(optim[j-g[i]] + p[i] > optim[j])
{
optim[j]=optim[j-g[i]] + p[i];
}
gout<<optim[G];
}