Cod sursa(job #1921949)
Utilizator | Data | 10 martie 2017 15:27:53 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#define N 5010
#define W 10010
using namespace std;
ifstream f("rucsac.in");
ofstream g("ruscac.out");
int w[N],v[N],a[N][W],i,j,n,m,l,we,k,t,p,r;
int main()
{
f>>n>>we;
for(i=1;i<=n;i++)
{
f>>w[i]>>v[i];
}
for(i=1;i<=n;i++,l=l-1)
{
for(j=0;j<=we;j++)
{
if(w[i]<=j)
{
a[l-1][j]=max(a[l-1][j],a[l][j-w[i]]+v[i]);
}
}
}
g<<a[l][we];
}