SMPAIR - Editorial

Problem link : contest practice

Difficulty : CakeWalk

Pre-requisites : Sorting

Problem : Given a sequence a1, a2, …, aN. Find the smallest possible value of ai + aj, where 1 ≤ i < jN


This problem was the easiest one in the set and it was intended to enable everybody to get some points.

How to get 13 points

Here you have only two integers a1 and a2, so the only possible sum will be a1+a2.

How to get 60 points

The constraints were designed in such a way that you can iterate through all the possible pairs (i, j), where 1 ≤ i < jN and check for every obtained sum, whether it’s the minimal one.

How to get 100 points

The answer is basically the sum of the minimal and the second-minimal element in the array. So you can simply iterate through all the numbers, keeping track of the minimal and the second-minimal number. Or if your programming language has built-in sorting, you can act even simpler, because after the sorting of the array in increasing order, the required minimal and the second-minimal will be the first and the second elements of the sorted array.

Related links

  • Reference in the built-in sorting for C++ users

Solutions : setter tester

1 Like

It can be done without sorting also.Check my solution click here

but you are essentially finding the smallest and second smallest element.

yeah no need to sort the inputs…just an inbuilt min() is enough in python…

Sorting will increase the complexity to O(nlogn), but a simple approach will be of O(n) i.e. iterating through the elements once or twice. Hence I preferred O(n) approach!

The question says i<j.
So for


the answer should be 1+3 =4 but sorting gives answer 1+2=3.
Please clarify my doubts.

1 Like

That is not important in fact. If you get i > j, then you can swap the values of i and j so that i < j.

In 2 1 3 4 we have i = 1, j = 2. Here you probably think that you should have i < j AND a[i] < a[j] but there was no such constraint in the statement.

Hey guys. My logic seems correct still I was getting WA for 3/4 of test cases.
Any suggestion ?

@y0g1337h your code is giving wrong answer [here][1] .output should be 4 but it is giving 6. Hope it helps . Here is your corrected


1 Like

But sorting needs O(nlogn) complexity.

Please help me and tell whats the mistake in my code

your code fails for test case



4 8 2

Please explain what is your logic as it hard to understands others code!

I really got frustrated when my code here din’t work at all
There might be some silly mistake I am doing
But I don’t know what is it?

Probably you have misunderstood the question. It is not that complicated as you think.

Since your code does not work for n=2 also, there must be some problem in your input. I dont think that the complex things you did to ‘save’ space was needed at all.

@yash_15 tell the mistake?

Can you please give me some test cases for which my code fails so that i could improve it. Thanks for helping me.

Hey!. Congrats your problem is solved you didn’t put \n in printf due to which you were getting wa. But now 3 cases are solved and only 1 is left. So keep trying…

My ans is accepted by making some modifications.Thank for ur help.