Pagini recente » Cod sursa (job #2943778) | Cod sursa (job #2868597) | Cod sursa (job #542462) | Cod sursa (job #775917) | Cod sursa (job #2467920)
#include<fstream>
using namespace std;
ifstream f1("rucsac.in");
ofstream f2("rucsac.out");
long long n, pd[10005], p[5005], w[5005], ma;
int main()
{
f1 >> n >> ma;
for(int i = 1; i <= n; ++i)
f1 >> w[i] >> p[i];
for(int i = 1; i <= n; ++i)
for(int j = ma - w[i]; j >= 0; --j)
pd[j + w[i]] = max(pd[j + w[i]], pd[j] + p[i]);
f2 << pd[ma];
f1.close();
f2.close();
return 0;
}