Find the minimum cost of adding the elements of a set (greedy algorithm)
I think the following algorithm can work (and is greedy):

Put all elements in a priority queue
While the priority queue has at least 2 elements, extract the two lowest elements, sum them, then add the sum to the priority queue

It gives a correct order for summing elements to get the minimal overall cost.