Cod sursa(job #2282896)
Utilizator | Data | 14 noiembrie 2018 18:23:42 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
//scrie parcugere inversa
#include <iostream>
#include <fstream>
using namespace std;
int n, g, crt[10500];
int main()
{
int w,p;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
fin>>n>>g;
for (int i=1;i<=n;i++)
{
fin>>w>>p;
for (int j=g;j>=w;j--)
{
if (p+crt[j-w]>crt[j])
crt[j]=p+crt[j-w];
}
}
fout<<crt[g];
return 0;
}