Find the least

CodeChefOpen on judge ↗

Given an array A of size N. Find two i, j such that A[i] + A[j] is smallest among all possible values of i, j.Now print how many possible values of i,j are possible? such that i<j ###Input: - First line consists of single integer $N$. - Second line consists of array of elements. ###Output: print a single line integer of max possible solutions ###Constraints - $1 \leq N \leq 1000000$ - $-20

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