The Smallest Pair - CodeChef Solution

Hello coders, today we are going to solve The Smallest Pair CodeChef Solution whose Problem Code is SMPAIR.

👊 Table Of Contents

• Task
• Input
• Output
• Constraints
• Example
• Solution - The Smallest Pair

Task

You are given a sequence a1, a2, ..., aN. Find the smallest possible value of ai + aj, where 1 ≤ i < j ≤ N.

Input

The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. 

The first line of each description consists of a single integer N.

The second line of each description contains N space separated integers - a1, a2, ..., aN respectively.

Output

For each test case, output a single line containing a single integer - the smallest possible sum for the corresponding test case.

Constraints

• T = 105, N = 2 : 13 points.
• T = 105, 2 ≤ N ≤ 10 : 16 points.
• T = 1000, 2 ≤ N ≤ 100 : 31 points.
• T = 10, 2 ≤ N ≤ 105 : 40 points.
• 1 ≤ ai ≤ 106

Example

Sample Input 

1
4
5 1 3 4

Sample Output

4

Explanation

Here we pick a2 and a3. Their sum equals to 1 + 3 = 4.

Solution - The Smallest Pair - CodeChef Solution

Python 3 

#Solution Provided by Sloth Coders 
T = int(input())
for i in range(T):
    n = int(input())
    s = list(map(int, input().split()))
    s.sort()
    print(s[0] + s[1])

Disclaimer: The above Problem (The Smallest Pair) is generated by CodeChef but the Solution is provided by Sloth Coders. This tutorial is only for Educational and Learning Purpose.

Also Read:

• Gross Salary - CodeChef Solution 
• Lapindromes - CodeChef Solution 
• Sums in a Triangle - CodeChef Solution 
• Primality Test - CodeChef Solution 
• Total Expense - CodeChef Solution