Pagini recente » Cod sursa (job #1855986) | Borderou de evaluare (job #851219) | Cod sursa (job #1671306)
#include <iostream>
#include <fstream>
#include <utility>
#include <vector>
#include <map>
using namespace std;
vector<pair<int, int> > Ob;
int nrO, G, a, b, pMax;
void RucsacNxG ();
void RucsacHash ();
void Read ();
int main()
{
Read();
//RucsacNxG();
RucsacHash();
}
void RucsacHash()
{
map<int, int> M;
M.insert(make_pair(0, 0));
for(int i = 1; i <= nrO; ++i)
{
for(map<int, int>::reverse_iterator it = M.rbegin(); it != M.rend(); ++it)
{
int newG = it->first + Ob[i].first;
if(newG <= G) {
int newProfit = it->second + Ob[i].second;
map<int, int>::iterator newEl = M.find(newG);
if(newEl == M.end())
M.insert(make_pair(newG, newProfit)), ++it;
else
newEl->second = max(newEl->second, newProfit);
}
}
}
cout<<M[G]<<'\n';
}
void RucsacNxG()
{
vector<int>D(G+1);
for(int o=1; o<=nrO; ++o)
for( int g=G; g>=0; --g)
if(Ob[o].first <= g)
D[g] = max(D[g], (D[g - Ob[o].first] + Ob[o].second) );
for(int i=0; i<=G; ++i)
pMax = max(pMax, D[i]);
cout<<pMax<<'\n';
}
void Read ()
{
freopen("rucsac.in", "rt", stdin);
freopen("rucsac.out", "wt", stdout);
scanf("%d%d", &nrO, &G);
Ob.push_back(make_pair(0, 0));
for(int i=1; i<=nrO; ++i){
scanf("%d%d", &a, &b);
Ob.push_back(make_pair(a, b));
}
}