Cod sursa(job #1522008)
Utilizator | Data | 11 noiembrie 2015 08:13:38 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,m,x,y,i,a[10001],b[10001],j;
int main()
{
f>>n>>m;
for(i=0;i<=m;i++) a[i]=0;
a[0]=1;
for(j=0;j<=m;j++) b[i]=0;
for(i=1;i<=n;i++)
{
f>>x>>y;
for(j=m;j>=0;j--) if(a[j]==1)
{
a[j+x]=1;
b[j+x]=max(b[j+x],b[j]+y);
}
}
g<<b[m];
return 0;
}