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 C (GCC 5.4.1) (judge verdict: Runtime Error)

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<limits.h>

#define rep(i,begin,end) for(int i=begin; i<end; i++)
#define revrep(i,begin,end) for(int i=begin; i>end; i--)
#define lld long long int

int binarySearch(int* p, int n, int target){
    int l = 0, r = n-1;
    int m = (l+r+1)/2;
    while(l < r){
        if(*(p + m) <= target){
            l = m;
        }else{
            r = m-1;
        }
        m = (l+r+1)/2;
    }
    /*if(*(p+m) != target){
        return -1;
    }*/
    return m;
}

int combination(int n, int r){
    if(r==0||r==n){
        return 1;
    }
    if(r==1){
        return n;
    }
    return combination(n-1,r-1)+combination(n-1,r);
}

int cmpAsc(const void* a, const void* b){
    int x = *(int*)a, y = *(int*)b;
    if(x > y){
        return 1;
    }
    if(x < y){
        return -1;
    }
    return 0;
}

int main(){
    int n;
    scanf("%d", &n);
    int a[n];
    rep(i, 0, n){
        scanf("%d", &a[i]);
    }
    qsort(a, n, sizeof(int), cmpAsc);
    int ans = -1, ans_x, ans_y;
    revrep(i, n-1, 0){
        int x = a[i], y, target = a[i]/2, buf;
        y = binarySearch(a, i, target);
        if(a[y] != target && y < i-1){
            if(abs(a[y] - target) >= abs(a[y+1] - target)){
                y++;
            }
        }
        y = a[y];
        buf = combination(x, y);
        if(ans < buf){
            ans = buf;
            ans_x = x;
            ans_y = y;
        }
    }
    printf("%d %d", ans_x, ans_y);

    return 0;
}