Mai intai trebuie sa te autentifici.
Cod sursa(job #2970584)
Utilizator | Data | 25 ianuarie 2023 16:26:07 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int N = 5000;
struct obiect{
int g,p;
}v[N];
int main()
{
int n,k,profit[N],maxx=-1;
fin>>n>>k;
for(int i=0;i<n;i++)
{
fin>>v[i].g>>v[i].p;
}
for(int i=1;i<=k;i++)
profit[i]=-1;
profit[0]=0;
for(int i=0;i<n;i++)
{
for(int j=k-v[i].g; j>=0; j--)
{
if(profit[j]!=1 && profit[j] + v[i].p > profit[j + v[i].g])
profit[j+v[i].g] = profit[j] + v[i].p;
}
}
for(int i=1;i<=k;i++)
{
if(profit[i]>maxx)
maxx=profit[i];
}
fout<<maxx;
return 0;
}