Pagini recente » Cod sursa (job #2789999) | Cod sursa (job #688809) | Cod sursa (job #2756133) | Cod sursa (job #2305306) | Cod sursa (job #3032675)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
long long int p[10001];
int main()
{
long long int n, g;
in >> n >> g;
for(int i = 1; i <= n; i++)
{
int pr, w;
in >> w >> pr;
for(int j = g; j >= w; j--)
{
p[j] = max(p[j], pr+p[j-w]);
}
}
long long int maxim = 0;
for(int i = 1; i <= g; i++) maxim = max(maxim, p[i]);
out << maxim;
return 0;
}