F

Given N numbers, X1, X2, … , XN, let us calculate the difference of every pair of numbers: ∣Xi - Xj∣ (1 ≤ i ＜ j ≤ N). We can get C(N,2) differences through this work, and now your task is to find the median of the differences as quickly as you can!

Note in this problem, the median is defined as the (m/2)-th smallest number if m,the amount of the differences, is even. For example, you have to find the third smallest one in the case of m = 6.

Input
The input consists of several test cases.
In each test case, N will be given in the first line. Then N numbers are given, representing X1, X2, … , XN, ( Xi ≤ 1,000,000,000 3 ≤ N ≤ 1,00,000 )

Output
For each test case, output the median in a separate line.

Sample Input
4
1 3 2 4
3
1 10 2
Sample Output
1
8

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int sum[100002];int lop[16000001],kol[16000001];
int judge(int x,int mid){
    int sum1=0;
    for(int i=1;i<=sum[0];i++)
        {int k=sum+sum[0]+1-upper_bound(sum+1,sum+sum[0]+1,sum[i]+x);
        sum1+=k;}
       // cout<<x<<" "<<sum1<<endl;
    if(sum1<=mid)//
        return true;
    else return false;
}
int main(){
    int n;
    while(~scanf("%d",&n)){
    sum[0]=n;
    for(int i=1;i<=n;i++)
        scanf("%d",&sum[i]);
    sort(sum+1,sum+n+1);
    long long num=(n-1)*n/2;
    num/=2;
    int maxx=sum[n]-sum[1];
    int l=0;
    while(l<maxx)
    {
        int mid=(l+maxx)>>1;

        if(judge(mid,num))
            maxx=mid;
        else l=mid+1;//左侧寻找模板要l=mid+1否则容易无限循环
    }
    cout<<maxx<<endl;
    }
}