class MinimumSquare{
    public:
        long long minArea(vector<int> x,vector<int> y,int K)
        {
            long long ret=0x7fffffffffff;
            long long l,d,r,u;
            long long L,R,mid;
            int cnt=x.size(),tans;
            for (int i=0;i<cnt;i++)
            {
                l=x[i]-1;u=y[i]-1;
                L=2;R=1e11;
                cerr<<l<<" "<<u<<endl;
                while (L<R)
                {
                    mid=(L+R)/2;
                    cerr<<mid<<endl;
                    r=l+mid;d=u+mid;
                    tans=0;
                    for (int j=0;j<cnt;j++)
                        if (x[j]>l && x[j]<r && y[j]>u && y[j]<d)
                            tans++;
                    if (tans>=K)
                    {
                        R=mid;
                        ret=min(ret,R);
                    }
                    else
                        L=mid+1;
                    //cerr<<tans;
                }
            }
            return ret*ret;
        }
};