the-smallest-pair.cpp

// https://www.codechef.com/problems/SMPAIR
#include<iostream>
#include <algorithm>
using namespace std;


void fill_array(int *array,  int n)
{
    int i;
    int number;
    for(i = 0; i< n; i++)
    {
        cin >> number;
        array[i] = number; 
    }
    /*array[0] = 5;
    array[1] = 1;
    array[2] = 3;
    array[3] = 4;
*/
}

int solve_test()
{
   int n;
   cin >> n; 
   int arr[n];
   fill_array(arr, n);
   /*
   for(int i =0; i< n; i++)
        cout << arr[i]<< " ";
   cout <<endl;
   */
   sort(arr, arr+n);
   // If N = 2;
   if(n==2)
   {
        if(arr[0] + arr[1] <= n)
            return arr[0]+arr[1];
        else
            return -1;
   }
   int sum;
   for(int i =0; i < n-1; i++)
   {
       for(int j= i+1; j<n; j++)
       {

           sum = arr[i] + arr[j];
           //cout <<"i: "<<i << " j: "<<j << " sum: "<<sum<<endl;
           if( i < j && sum <=n)
                return sum; 
       }
   }   
   // Something went wrong
   return -1;
}
int main()
{
    int t;
    cin >> t;
    while(t--)
        cout<<solve_test()<<endl;

    return 0;
}