Cod sursa(job #2232463)
| Utilizator | Data | 19 august 2018 13:40:48 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,v[2][10005];
struct per{
int gr;
int val;
}p[5005];
int main()
{
in >> n >> g;
for(int i=1; i<=n; i++)
{
in >> p[i].gr >> p[i].val;
}
for(int i=0; i<=g; i++)
{
v[0][i]=0;
}
for(int i=1; i<=n; i++)
{
for(int j=0; j<=g; j++)
{
if(p[i].gr>j)
{
v[1][j]=v[0][j];
}
else
{
v[1][j]=max(v[0][j],v[0][j-p[i].gr]+p[i].val);
}
}
for(int j=0; j<=g; j++)
{
v[0][j]=v[1][j];
}
}
out << v[1][g];
return 0;
}
