Problem:
Score : 400 points

Problem Statement

Let {\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.
From n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\rm comb}(a_i,a_j) is maximized.
If there are multiple pairs that maximize the value, any of them is accepted.

Constraints

2 \leq n \leq 10^5

0 \leq a_i \leq 10^9

a_1,a_2,...,a_n are pairwise distinct.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

n
a_1 a_2 ... a_n

Output

Print a_i and a_j that you selected, with a space in between.

Sample Input 1

5
6 9 4 2 11

Sample Output 1

11 6

\rm{comb}(a_i,a_j) for each possible selection is as follows:

\rm{comb}(4,2)=6

\rm{comb}(6,2)=15

\rm{comb}(6,4)=15

\rm{comb}(9,2)=36

\rm{comb}(9,4)=126

\rm{comb}(9,6)=84

\rm{comb}(11,2)=55

\rm{comb}(11,4)=330

\rm{comb}(11,6)=462

\rm{comb}(11,9)=55

Thus, we should print 11 and 6.

Sample Input 2

2
100 0

Sample Output 2

100 0

Solution in Go (1.6) (judge verdict: Accepted)

package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"sort"
	"strconv"
)

type Num struct {
	Num int
}

type Nums []Num

func (n Nums) Len() int {
	return len(n)
}

func (n Nums) Swap(i, j int) {
	n[i], n[j] = n[j], n[i]
}

func (n Nums) Less(i, j int) bool {
	return n[i].Num < n[j].Num
}

func main() {
	s := IOInitialize()
	n := Int(s)
	nums := scanNums(s, n)
	sort.Sort(nums)
	max := nums[n-1].Num
	min := nums[0].Num
	minDistance := abs((max - min) - min)
	for i := 0; i < n-1; i++ {
		num := nums[i].Num
		distance := abs((max - num) - num)
		if minDistance > distance {
			min = num
			minDistance = distance
		}
	}
	fmt.Println(fmt.Sprintf("%d %d", max, min))
}

func abs(a int) int {
	return int(math.Abs(float64(a)))
}

func scanNums(s *bufio.Scanner, len int) (nums Nums) {
	for i := 0; i < len; i++ {
		num := Int(s)
		nums = append(nums, Num{Num: num})
	}
	return
}

func IOInitialize() *bufio.Scanner {
	s := bufio.NewScanner(os.Stdin)
	s.Split(bufio.ScanWords)
	return s
}

func Int(s *bufio.Scanner) int {
	if !s.Scan() {
		panic("\t\tThere is a FALSE not to want.")
	}

	value, err := strconv.Atoi(s.Text())
	if err != nil {
		panic("\t\tError:Failed to convert text to int,")
	}
	return value
}

func String(s *bufio.Scanner) string {
	if !s.Scan() {
		panic("\t\tThere is a FALSE not to want.")
	}

	return s.Text()
}