Problem Statement:
"GTX" is an online game where you have many missions each of them is in a different place. One only need to finish at least two missions to win. Write a program to determine the closest two missions to do in order to win this game.
Input Format:
Given N the number of missions, followed by N numbers each number represent the distance of each mission
2 < N < 101
I guarantee each distance will fit into integer
Output Format:
print the smallest two distances sorted
Sample Input:
5
3
23
1
6
9
Sample Output:
1 3
Added by:

gammal

Added at:

20150213 22:53:02 UTC

Time Limit:

1 second

Partial score:

No
