Pagini recente » Cod sursa (job #1780953) | Cod sursa (job #2848585) | Cod sursa (job #2770031) | Cod sursa (job #2122078) | Cod sursa (job #1902593)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int w[5005], p[5005];
vector<int> optim;
int main()
{
int n, G, sol = 0;
fin >> n >> G;
for(int i=1; i<=n; i++) fin >> w[i] >> p[i];
optim.assign(G+1,0);
for (int i=1; i<=n; i++) {
for (int j=G-w[i]; j>=0; j--) {
if (optim[j+w[i]] < optim[j] + p[i]) {
optim[j+w[i]] = optim[j] + p[i];
if (sol < optim[j+w[i]]) sol = optim[j+w[i]];
}
}
}
fout << sol;
return 0;
}