Untitled
unknown
python
2 years ago
288 B
29
Indexable
Never
1# cook your dish here t = int(input()) while (t > 0): n = int(input()) k = int(input()) print(n) for i in range(n): a[i] = int(input()) b = a.sort if ((b[0] + b[n - 1]) <= k): print("yeS") else: print("NO") t = t-1