Binomial Coefficients

http://icpc.upc.edu.cn/problem.php?cid=1706&pid=1

#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
long long n,a[10000000],i,k1,ans,k;
double max1=100000000000;
int main() {
    scanf("%lld",&n);
    for (i=1; i<=n; i++) {
        scanf("%lld",&a[i]);
        k=max(k,a[i]);
    }
    double k1=k/2.0;
    for (i=1; i<=n; i++) {
        if (fabs(a[i]-k1)<max1) {
            max1=abs(a[i]-k1);
        }
    }
    for (i=1; i<=n; i++) {
        if (fabs(a[i]-k1)==max1&&a[i]!=k){
            printf("%lld %lld\n",k,a[i]);
            return 0;
        }
    }
}