Cod sursa(job #2279879)
| Utilizator | Data | 10 noiembrie 2018 10:06:15 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, g, prv[5500], crt[5500], p[5500], w[5500];
int main()
{
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
fin>>n>>g;
for (int i=1;i<=n;i++)
fin>>w[i]>>p[i];
for (int i=1;i<=n;i++)
{
for (int j=0;j<=g;j++)
{
if (p[i]+prv[j-w[i]]>prv[j]&&j>=w[i])
crt[j]=p[i]+prv[j-w[i]];
else
crt[j]=prv[j];
}
for (int j=1;j<=g;j++)
prv[j]=crt[j];
}
fout<<crt[g];
return 0;
}
