LINQ Select in descending order from collection, three different values that go up to the maximum value of the element

For example i have a collection like this

var c1 = new Collection<int>{0,0,2,2,2,3,3,4,4,4,4,5,5,6,6,7};  

I would like to get result like this

(6,5,4)

>Solution :

You can do:

c1.Distinct()
    .OrderByDescending(x => x)
    .Skip(1)
    .Take(3)
    .ToList()

First remove all the duplicates, then sort despondingly. Skip(1) so that the max element is removed. Finally you can take 3 elements from the rest.