Cod sursa(job #1637251)
Utilizator | Data | 7 martie 2016 16:01:16 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, v[10050],o, greu,i, pret,maxi;
int main()
{
fin>>n>>g;
for(o=0; o<n; o++)
{
fin>>greu>>pret;
for(i=g; i>=1; i--)
{
if(v[i]!=0 and i+greu<=g)
{
if(v[i+greu]<pret+v[i])
{
v[i+greu]=v[i]+pret;
}
}
}
if(v[greu]<pret)
{
v[greu]=pret;
}
}
for(i=1; i<=g; i++)
if(v[i]>maxi)
maxi=v[i];
fout<<maxi;
return 0;
}