Cod sursa(job #663879)
Utilizator | Data | 19 ianuarie 2012 09:00:45 | |
---|---|---|---|
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 g("rucsac.out");
int N,G,a[10005];
int main()
{
int i,j,w,p;
f>>N>>G;
a[0]=1;
for(i=1;i<=N;i++)
{
f>>w>>p;
for (j=G-w;j>=0;j--)
{
if (a[j]+p>a[j+w])
a[j+w]=a[j]+p;
}
}
p=0;
for(i=0;i<=G;i++)
{
if(a[i]>p)
p=a[i];
}
g<<p-1;
return 0;
}