Add solution for UVA 11264 Coin Collector
Greedy Algorithm

1. coins[n - 1] must be selected
2. sum(coins[1]...coins[i - 1]) + coins[i] < coins[i + 1]
   => coins[i] can be selected