Cod sursa(job #2203408)
Utilizator | Data | 12 mai 2018 11:15:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
ifstream f("rucsac.in");
ofstream gg("rucsac.out");
int N,G,i,g,v,max,j;
f>>N>>G;
int d[G+1];
d[0]=0;
for(i=1;i<=G;i++)
d[i]=-1;
for(i=1;i<=N;i++)
{
f>>g>>v;
for(j=G;j>=0;j--)
{
if(d[j]!=-1)
d[j+g]=d[j]+v;
}
}
max=0;
for(i=1;i<=G;i++)
if(d[i]>max)
max=d[i];
gg<<max;
return 0;
}