Cod sursa(job #663450)
Utilizator | Data | 18 ianuarie 2012 15:36:09 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int n,h,a[10200],i,j,p,w;
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>n>>h;
a[0]=1;
for(i=0;i<n;i++)
{
f>>w>>p;
for(j=h-w;j>=0;j--)
{
if(a[j]+p>a[j+w])
a[j+w]=a[j]+p;
}
}
p=0;
for(i=0;i<=h;i++)
{
if(a[i]>p)
p=a[i];
}
g<<p-1;
f.close();
g.close();
return 0;
}