Cod sursa(job #1477881)
Utilizator | Data | 27 august 2015 12:08:16 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#define N 202
#define M 98999
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,i,w,W,V,v[10010];
int main()
{
f>>n>>w;
for(i=1;i<=w;i++)v[i]=1<<31;
for(;n;n--)
{
f>>W>>V;
for(i=w-W;i>=0;i--)
if(v[i]>=0)
v[i+W]=max(v[i+W],v[i]+V);
}
for(i=1,V=0;i<=w;i++)V=max(V,v[i]);
g<<V<<'\n';
return 0;
}