how to efficiently get the k bigger elements of a list in python

Question

What´s the most efficient, elegant and pythonic way of solving this problem?

Given a list (or set or whatever) of n elements, we want to get the k biggest ones. ( Yo

Answer 1

sorted(l, reverse=True)[:k]