poj3685

二分套二分。
我们首先二分第m大的数是多少，二分出来以后，我们去判断整个N*N的矩阵里面小于它的数有多少个。通过观察i*i + 100000 * i + j*j - 100000 * j + i * j 这个式子，我们可以发现，当j不变时，式子的值是随着i的变大而变大的，即随i单调递增。那么我们就枚举每一列，然后二分所有的行，看看在那一列中小于那个数的有多少，统计所有列的情况，加起来，判断小于的个数是否

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 210
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
int a[100010];
ll k;
ll Func(ll i,ll j){
    return   i*i + 100000 * i + j*j - 100000 * j + i * j;
}
bool check(ll x){
    ll res=0;
    for(ll j=1;j<=n;j++){   //枚举所有的列
        ll l=1,r=n;     //二分行
        while(l<=r){
            ll mid = (l+r)>>1;
            if(Func(mid,j)<=x)
                l = mid+1;
            else
                r = mid-1;
        }
        res += l-1; //减去本身
    }
    return res<k;   //小于x的数是否小于k
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
#endif
    int t;
    sf(t);
    while (t--) {
        scanf("%d%I64d",&n,&k);
        ll l = -10000000000ll;
        ll r = -l;
        while (l <= r) {
            ll mid = (l + r) >> 1;
            if (check(mid))  //除了本身以外，比mid小的应该有m-1个数字
                l = mid + 1;
            else
                r = mid - 1;
        }
        printf("%I64d\n", l);
    }
    return 0;
}