二分搜索1-

原题

#include <iostream>
using namespace std;
typedef long long  ll;
const int sm=(int)1e5;
ll m,n;
ll Count(ll i,ll j){
    return i*(i+j+sm)+j*(j-sm);
}
bool judge(ll x){
    ll cnt = 0;
    for(int j = 1; j <= n; j++){
        int l = 1, r = n;
        while(l <= r){
            int mid = (l+r) >> 1;
            if( Count(mid,j) <= x)
                l = ++mid;
            else
                r = --mid;
        }
        cnt += l-1;
    }
    return cnt < m;
}
ll solve(){
    ll l = -(n*n*3+sm*n); ll r = -l;
    while(l <= r){
        ll mid = (l+r) / 2;
        if(judge(mid))
            l = ++mid;
        else
            r = --mid;
    }
    return l;
}
int main(){
    int test;
    for(cin>>test;test;test--){
        cin>>n>>m;
        cout<<solve()<<endl;
    }
    return 0;
}