Pagini recente » Cod sursa (job #682487) | Cod sursa (job #2886498) | Cod sursa (job #1294718) | Cod sursa (job #1440366) | Cod sursa (job #1718398)
#include <iostream>
#include<fstream>
using namespace std;
unsigned long long int a[5001][10001];
int main()
{
unsigned long long int g[5001],c[5001],n,gr,i,j;
ifstream f("rucsac.in");
ofstream gg("rucsac.out");
f>>n>>gr;
for(i=1; i<=n; i++)
f>>g[i]>>c[i];
for(i=1; i<=n; i++)
for(j=1; j<=gr; j++)
if(j>=g[i])
a[i][j]=max(c[i]+a[i-1][j-g[i]],a[i-1][j]);
else
a[i][j]=a[i-1][j];
gg<<a[n][gr];
f.close();
gg.close();
return 0;
}