Задача про 2 рюкзака

#include <iostream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <ctime>
 
int RandomInteger() {
  return rand() % 1000 + 1;
}
 
template <class T>
std::ostream &operator<<(std::ostream &stream, const std::vector<T> &heap) {
  for (typename std::vector<T>::const_iterator i = heap.begin();
    i != heap.end(); ++i)
    stream << *i << " ";
  return stream;
}
 
int main(int argc, char *argv[]) {
  srand(time(NULL));
  size_t stackSize = 10;
  std::vector<int> heap(stackSize);
  std::generate(heap.begin(), heap.end(), RandomInteger);
  std::cout << "Heap:" << std::endl << heap << std::endl;
  std::sort(heap.begin(), heap.end());
  std::cout << "Sorted heap:" << std::endl << heap << std::endl;
  
  std::vector<int> part1, part2;
  int part1Size = 0;
  int part2Size = 0;
  for (std::vector<int>::reverse_iterator i = heap.rbegin(); i != heap.rend(); ++i) {
    if (part1Size > part2Size) {
      part2Size += *i;
      part2.push_back(*i);
    } else {
      part1Size += *i;
      part1.push_back(*i);
    }
  }
  std::cout << "Part one, size = " << part1Size << ":" << std::endl << part1 << std::endl;
  std::cout << "Part two, size = " << part2Size << ":" << std::endl << part2 << std::endl;
}