Cod sursa(job #1174322)
Utilizator | Data | 22 aprilie 2014 15:50:34 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
# include <fstream>
# include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int i,j,n,G;
int P[5005],gr[5005],a[10005];
int main ()
{
f>>n>>G;
for (i=1; i<=n; ++i)
f>>gr[i]>>P[i];
for (i=1; i<=n; ++i)
{
for (j=G-gr[i]; j>=0; --j)
{
if (a[j+gr[i]]<a[j]+P[i]) a[j+gr[i]]=a[j]+P[i];
}
}
g<<a[G]<<"\n";
return 0;
}