Cod sursa(job #2027556)
Utilizator | Data | 26 septembrie 2017 12:04:42 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream fout("rucsac.out");
int n,G,v[10001],g,p,i,j;
int main()
{
f>>n>>G;
for(i=1;i<=G;i++)
v[i]=-1;
for(i=1;i<=n;i++)
{
f>>g>>p;
for(j=G-g;j>=0;j--)
if(v[j]!=-1&&v[j+g]<v[j]+p)
v[j+g]=v[j]+p;
}
int Max=-1;
for(i=1;i<=G;i++)
if(v[i]>Max)
Max=v[i];
fout<<Max;
return 0;
}