Is it the problem of the Greedy?

#1

Is it the problem of the Greedy?
If Yes, Please tell What does it means?
http://codeforces.com/problemset/problem/160/A

#2

@cbcao263,
Yes the problem is greedy, you just have to find the minimum number of coins to make a value of at least s/2, where s=sum of values of all coins. Greedily choose the largest ones, it will give minimum number of coins.