The Smallest Pair ||codechef||beginner solution ||programming info

You are given a sequence a₁, a₂, ..., a_N. Find the smallest possible value of a_i + a_j, 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 - a₁, a₂, ..., a_N 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 = 10⁵, N = 2 : 13 points.
• T = 10⁵, 2 ≤ N ≤ 10 : 16 points.
• T = 1000, 2 ≤ N ≤ 100 : 31 points.
• T = 10, 2 ≤ N ≤ 10⁵ : 40 points.
• 1 ≤ a_i ≤ 10⁶

Example

Input:
1
4
5 1 3 4

Output:
4

Explanation

Here we pick a₂ and a₃. Their sum equals to 1 + 3 = 4.

SOLUTION USING C++ LANGUAGE:-

#include <bits/stdc++.h>
using namespace std;

int main() 
{
 int t,n;
 cin >>t;
 while(t--)
 {
 int i;
 cin>>n;
 int a[n];
 for(i=0;i<n;i++)
 {
  cin>>a[i];
 }
 sort(a,a+n);
 cout<<a[0]+a[1]<<"\n";
 }return 0;

} 

Share: