Minimum sum
Medium Accuracy: 4.95% Submissions: 300 Points: 4

Given an array Arr of size N such that each element is from the range 0 to 9. Find the minimum possible sum of two numbers formed using the elements of the array. All digits in the given array must be used to form the two numbers.

Example 1:

N = 6
Arr[] = {6, 8, 4, 5, 2, 3}
Output: 604
Explanation: The minimum sum is formed 
by numbers 358 and 246.

Example 2:

N = 5
Arr[] = {5, 3, 0, 7, 4}
Output: 82
Explanation: The minimum sum is 
formed by numbers 35 and 047.

Your Task:
You don't need to read input or print anything. Your task is to complete the function solve() which takes arr[] and as input parameters and returns the minimum possible sum. As the number can be large, return string presentation of the number without leading zeroes.


Expected Time Complexity: O(N*logN)
Expected Auxiliary Space: O(1)

1 ≤ N ≤ 107
0 ≤ Arri ≤ 9

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Output Window