Cevallos

Ok, I used Eclipse to format the code. Should be fine now.

Besides, I speeded up the algorithm by using a queue. This queue prevents us from doing redundant work since we are iterating the list over and over again to find a share with less than k accepts. We just store into the queue the "bad" participants preventing, as mentioned, the redundant iterating.