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 Rust (1.15.1) (judge verdict: Wrong Answer)

use std::cmp::min;
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}
fn main() {
    let n = read::<i64>();
    let mut xn = read_vec::<i64>();
    xn.sort();
    // if xn.contains(&0){
    //       xn.retain(|&x| x== 0);
    // }
  
    let mut ans = (xn[1],xn[0]);
    let mut v:Vec<i64> = Vec::new();
    let maxv = xn.iter().max().unwrap();
    let sub = xn.iter().filter(|&x| x != maxv).map(|&x| min(x,(maxv -x))).max().unwrap();
    let ans = (maxv,sub);
        // if xn[j as  usize] < xn[i as usize]  &&xn[j as  usize] != 0  && xn[i as usize] != 0{
        //         if ans.0 <  xn[i as usize] && ans.1 < min(xn[i as usize] - xn[j as usize],xn[j as usize] ){
        //             ans = (xn[i as usize],xn[j as usize]);
        //         }
        //     }   

    println!("{} {}",ans.0,ans.1 );
}
fn comb(a:i64, b:i64) -> i64 {
    let x = (a-b+1..a + 1).fold(1,|n,m| n * m);
  
    let y =(1..b+1).fold(1,|n,m| n * m);
  
    x / y
}