All Tracks Data Structures Arrays 1-D Problem

You are given length of n sides, you need to answer whether it is possible to make n sided convex polygon with it.

Input : -

First line contains \(T\),no .of testcases.

For each test case , first line consist of single integer \(N\),second line consist of \(N\) \((l_1,l_2\dots l_n)\)spaced integers, size of each side.

Output : -

For each test case print "Yes" if it is possible to make polygon or else "No" if it is not possible.

\(1 \leq T \leq 10\)

\(1 \leq n \leq 10^5\)

\(1 \leq l_i \leq 10^4\)