Smallest Pair Sum in an array

Given an array of distinct integers arr[], the task is to find a pair which has the minimum sum and print the sum.

Examples:

Input: arr[] = {1, 2, 3}
Output: 3
The pair (1, 2) will have the minimum sum pair i.e. 1 + 2 = 3



Input: arr[] = {3, 5, 6, 2}
Output: 5

Approach:

  • Find the minimum element from the array and store it in min.
  • Find the second minimum element from the array and store it in secondMin.
  • Print min + secondMin.

Below is the implementation of the above approach:

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ program to print the sum of the minimum pair
#include <bits/stdc++.h>
using namespace std;
  
// Function to return the sum of
// the minimum pair from the array
int smallest_pair(int a[], int n)
{
    int min = INT_MAX, secondMin = INT_MAX;
    for (int j = 0; j < n; j++) {
  
        // If found new minimum
        if (a[j] < min) {
  
            // Minimum now becomes second minimum
            secondMin = min;
  
            // Update minimum
            min = a[j];
        }
  
        // If current element is > min and < secondMin
        else if ((a[j] < secondMin) && a[j] != min)
  
            // Update secondMin
            secondMin = a[j];
    }
  
    // Return the sum of the minimum pair
    return (secondMin + min);
}
  
// Driver code
int main()
{
    int arr[] = { 1, 2, 3 };
    int n = sizeof(arr) / sizeof(arr[0]);
  
    cout << smallest_pair(arr, n);
  
    return 0;
}

chevron_right


C#

// C# program to print the sum
// of the minimum pair
using System;

class GFG
{
// Function to return the sum of
// the minimum pair from the array
static int smallest_pair(int[] a, int n)
{
int min = int.MaxValue, secondMin = int.MaxValue;
for (int j = 0; j < n; j++) { // If found new minimum if (a[j] < min) { // Minimum now becomes second minimum secondMin = min; // Update minimum min = a[j]; } // If current element is > min and < secondMin else if ((a[j] < secondMin) && a[j] != min) // Update secondMin secondMin = a[j]; } // Return the sum of the minimum pair return (secondMin + min); } // Driver code public static void Main() { int[] arr = { 1, 2, 3 }; int n = arr.Length; Console.Write(smallest_pair(arr, n)); } } // This code is contributed // by Akanksha Rai [tabby title="PHP"]

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP program to print the sum 
// of the minimum pair 
  
// Function to return the sum of 
// the minimum pair from the array 
function smallest_pair($a, $n
    $min = PHP_INT_MAX;
    $secondMin = PHP_INT_MAX; 
    for ($j = 0; $j < $n; $j++) 
    
  
        // If found new minimum 
        if ($a[$j] < $min
        
  
            // Minimum now becomes 
            // second minimum 
            $secondMin = $min
  
            // Update minimum 
            $min = $a[$j]; 
        
  
        // If current element is > min 
        // and < secondMin 
        else if (($a[$j] < $secondMin) &&
                  $a[$j] != $min
  
            // Update secondMin 
            $secondMin = $a[$j]; 
    
  
    // Return the sum of the minimum pair 
    return ($secondMin + $min); 
  
// Driver code 
$arr = array( 1, 2, 3 ); 
$n = sizeof($arr); 
echo smallest_pair($arr, $n); 
  
// This code is contributed by ajit
?>

chevron_right


Output:

3


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : jit_t