Cod sursa(job #2380408)
Utilizator | Data | 14 martie 2019 21:17:03 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#define NMAX 5005
#define NMAXIM 10005
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gr,i,j;
int v[NMAXIM],w[NMAX],p[NMAX];
int main()
{
f>>n>>gr;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++)
{
for(j=gr;j>=w[i];j--)
{
v[j]=max(v[j],v[j-w[i]]+p[i]);
}
}
g<<v[gr];
}