Cod sursa(job #1978227)
| Utilizator | Data | 7 mai 2017 10:12:20 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#define Nmax 5001
#define Gmax 10001
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, G, w[Nmax], p[Nmax],sol, pr[Gmax][Nmax],l;
int main()
{
f>>n>>G;
for(int i=1;i<=n;i++)
{
f>>w[i]>>p[i];
}
for(int i=1;i<=n;i++)
{
for(int k=w[i];k<=G;k++)
{
for(int j=0;j<i;j++)
{
pr[k][i]=max(pr[k][i], pr[k-w[i]][j]+p[i]);
}
sol=max(sol, pr[k][i]);
}
}
g<<sol;
}
