Cod sursa(job #1088811)
Utilizator | Data | 20 ianuarie 2014 20:49:50 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int main()
{
int i,j,n,g,v[10001],w[5001],k,p[5001];
g>>n>>g;
for(i=1;i<=n;i++)
g>>w[i]>>p[i];
v[0]=0;
for(i=1;i<=n;i++)
for(j=g-w[i];j>=0;j--)
if(v[j+w[i]]<v[j]+p[i])
{
v[j+w[i]]=v[j]+p[i];
if(v[j+w[i]]>k)
k=v[j+w[i]];
}
g<<k;
}