Quick Start C: Loops, Arrays, Functions
Find two different minimal elements in the given sequence of numbers.
First line contains the number of elements n (3 ≤ n ≤ 1000) in the sequence. Then given n integers, each of them is no more than 2 *
109 by absolute value.
Print in increasing order two different minimal elements from the given sequence. It is known that they always exist.
7 2 10 2 3 -1 5 -1