Truly linear time implementation of the greedy algorithm for set cover.

TODO:
-----

* clean up code, deallocate data structure at the end, check for memory leaks
* proper storing of the solutions
* add support for decoding of binary instances
* add budgeted variant
* benchmark against map-based implementation and competing implementations
* write Python wrapper