Pagini recente » Cod sursa (job #2913016) | Cod sursa (job #2334651) | Cod sursa (job #602421) | Cod sursa (job #2342927) | Cod sursa (job #1852647)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int v[5001];
int p[5001];
int a[2][5001];
int main()
{int n,V;
f>>n>>V;
int i,j;
for(i=1;i<=n;i++)
f>>v[i]>>p[i];
int l=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=V;j++)
{
a[1-l][j]=a[l][j];
if(j>=v[i])
a[1-l][j]=max(a[1-l][j],p[i]+a[l][j-v[i]]);
}
l=1-l;
}
g<<a[l][V];
return 0;
}