Pagini recente » Cod sursa (job #2539494) | Cod sursa (job #2859011) | Cod sursa (job #2425422) | Cod sursa (job #2422349) | Cod sursa (job #1852650)
#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[10005];
int b[10005];
int main()
{int n,V;
f>>n>>V;
int i,j;
for(i=1;i<=n;i++)
f>>v[i]>>p[i];
for(i=1;i<=n;i++)
{
for(j=1;j<=V;j++)
if(j>=v[i])
b[j]=max(a[j],p[i]+a[j-v[i]]);
else b[j]=a[j];
for(j=1;j<=V;j++)
a[j]=b[j];
}
g<<b[V];
return 0;
}