Question

You are given an array A. You need to create a good subset out of this array.
A good subset is defined as a subset of the array A in which if any 3 numbers are
picked, they will form the sides of the triangle
What is the maximum size of a good subset you can pick?
Input Format
The first line contains an integer, N, denoting the number of elements in A.
Each line i of the N subsequent lines (where 0 <=i< N) contains an integer describing
A[i].
Constraints
1 <= N <= 1045​

Answer 1

223

Explanation:

it near yest subsect