We analyze different solutions taking into account the time and memory complexity of the programmed algorithms. We also rapasamos useful data structures for this type of greedy problems.