O(nlogn) Array

CodeChefOpen on judge ↗

Given a set of $n$ integers $S$ and an integer $x$, your task is to determine whether there exist two elements in $S$ whose sum is $x$. In case no such elements exist in the array, print “NOT AVAILABLE” without the quotes. Otherwise, print “AVAILABLE” without the quotes and the two elements, space-separated. Note that the two elements need to be the smallest elements that sum up to $x$. Your

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI