[ KD-tree ] [ CQOI2016 ] BZOJ4520

用一个堆维护前 $k$ 大，然后枚举每个点更新就好了。
由于点对是无序的，应该维护前 $2k$ 大。

#include<bits/stdc++.h>
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void Read(int& x){
    char c=nc();
    for(;c<'0'||c>'9';c=nc());
    for(x=0;c>='0'&&c<='9';x=(x<<3)+(x<<1)+c-48,c=nc());
}
typedef long long ll;
const int N=100010;
struct Node{
    int l,r;
    int v[2],mx[2],mn[2];
}a[N];
priority_queue<ll,vector<ll>,greater<ll> >Q;
int Rt;
bool cur;
int k,n,m;
namespace KDT{
    inline bool Cmp(Node a,Node b){
        return a.v[cur]<b.v[cur];
    }
    inline void Up(int x){
        for(int i=0;i<2;i++){
            if(a[x].l){
                a[x].mx[i]=max(a[x].mx[i],a[a[x].l].mx[i]);
                a[x].mn[i]=min(a[x].mn[i],a[a[x].l].mn[i]);
            }
            if(a[x].r){
                a[x].mx[i]=max(a[x].mx[i],a[a[x].r].mx[i]);
                a[x].mn[i]=min(a[x].mn[i],a[a[x].r].mn[i]);
            }
        }
    }
    int Build(int l,int r,bool d){
        int Mid=l+r>>1;
        cur=d;
        nth_element(a+l,a+Mid,a+r+1,Cmp);
        if(l<Mid)a[Mid].l=Build(l,Mid-1,d^1);
        if(r>Mid)a[Mid].r=Build(Mid+1,r,d^1);
        Up(Mid);
        return Mid;
    }
    inline ll Sqr(int x){
        return 1ll*x*x;
    }
    inline ll Dis(int x,int y){
        ll Ans=0;
        for(int i=0;i<2;i++)Ans+=Sqr(a[x].v[i]-a[y].v[i]);
        return Ans;
    }
    inline ll Get(int x,int y){
        ll Ans=0;
        for(int i=0;i<2;i++)
        Ans+=max(Sqr(a[x].mn[i]-a[y].v[i]),Sqr(a[x].mx[i]-a[y].v[i]));
        return Ans;
    }
    void Query(int x,int y){
        ll t=Dis(x,y);
        if(t>Q.top())Q.pop(),Q.push(t);
        ll dl=0,dr=0;
        if(a[x].l)dl=Get(a[x].l,y);
        if(a[x].r)dr=Get(a[x].r,y);
        if(dl>dr){
            if(dl>Q.top())Query(a[x].l,y);
            if(dr>Q.top())Query(a[x].r,y);
        }else{
            if(dr>Q.top())Query(a[x].r,y);
            if(dl>Q.top())Query(a[x].l,y);
        }
    }
}
int main(){
    Read(n);Read(k);
    for(int i=1;i<=n;i++){
        Read(a[i].v[0]),Read(a[i].v[1]);
        a[i].mx[0]=a[i].mn[0]=a[i].v[0];
        a[i].mx[1]=a[i].mn[1]=a[i].v[1];
    }
    Rt=KDT::Build(1,n,0);
    for(int i=1;i<=(k<<1);i++)Q.push(0);
    for(int i=1;i<=n;i++)KDT::Query(Rt,i);
    cout<<Q.top()<<endl;
    return 0;
}