Description:
During superman’s childhood, he has been addicting to playing with sticks. After all, superman is only a child. He tries his best to form a triangle by using such sticks (None of them can be bended).

Input:
Given an integer n (3<=n<=30), which means the total number of sticks (Number 0 indicates the end of input). And n integers followed by mean the different length of such sticks(1<=len[i]<=100).
Output:
If such sticks can form a triangle (All of them should be used), please print “Yes”, or print the word “No”.

Sample Input:
3
20 30 10
4
20 30 10 10
0
Sample Output:
No
Yes

谢谢

我提供一种想法不知道对不对，仅供参考。可以多讨论一下。
思路是这样的，把所有的数并成三个数，尽量使这些数尽量接近就可以了，这个不难作到。
然后再判断是否可以组成三角形。

我来给个方法
假设有n（n>=3）个数
n>3时，找到这n个数中最小的数和倒数第2小的数，将其相加，合并成为一个新的数，此时还剩下n-1个数，然后再找到这n-1个数中最小的数和倒数第2小的数，相加合并.......直到最后只有3个数为止，然后判断这3个数是否满足构成3角形的条件就可以了

先谢了,我去试试看

请写出这个题的出处,谢谢

http://acm.zjut.edu.cn/ShowProblem.aspx?ShowID=1065

恩,三楼的算法是正确的,

是的,三楼的是对的,谢谢大家!

我好像举不出反例
但能不能证明一下，毕竟相信证明，这没根没据的让我无法相信。