simple greedy k-coverage solution in python

let's say you have a list of sets [{1,5,6},{9,12},{3,6},{4,6},{5,3}] with 3 sets, you want to achieve the highest coverage, that is, the union of your 3 selected sets has the largest size.