Cod sursa(job #1208708)
Utilizator | Data | 16 iulie 2014 14:00:21 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int a[5001],b[5001],v[10001],n,s,i,j,mx;
int main()
{
f>>n>>s;
for(i=1;i<=n;i++)f>>a[i]>>b[i];
for(i=1;i<=n;++i)
for(j=s-a[i];j>=0;--j)
if(v[j+a[i]]<v[j]+b[i])
{
v[j+a[i]]=v[j]+b[i];
if(v[j+a[i]]>mx)mx=v[j+a[i]];
}
g<<mx;
return 0;
}