Mai intai trebuie sa te autentifici.
Cod sursa(job #2178674)
| Utilizator | Data | 19 martie 2018 17:37:27 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
#define MXN 5001
#define MXG 5001
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int D[MXN][MXG];
int n,g;long V[MXG];
int w[MXN],p[MXN];
int max(int a,int b)
{
if(a>b) return a;
else return b;
}
int rucsac(int n,int g)
{
int i,j;
for(i=1;i<=n;i++)
for(j=g;j>=w[i];j--)
V[j]=max(V[j],V[j-w[i]]+p[i]);
return V[g];
}
int main()
{
int i;
fin>>n>>g;
for(i=1;i<=n;i++)
fin>>w[i]>>p[i];
fout<<rucsac(n,g);
fin.close();
fout.close();
return 0;
}
