Language: C++

// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define fs first
#define sc second
#define pb push_back
#define eb emplace_back
#define SP << " " <<

typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;
typedef vector<P> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<vector<P>> pvvec;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQIG;
typedef priority_queue<P,vector<P>,greater<P>> PQPG;

const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
constexpr int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30); // 1073741824
const int INF = (1LL << 60); // 1152921504606846976
const double EPS = (1 >> 30);

template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline T ceil(T a, T b) {return T((a + b - 1) / b);}
template<class T> inline T round(T a, T b) {return T(a / b);}
template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; }
template <class T> inline void out(T &a) { bool flag=true; for(auto&x:a){if(flag) {flag=false;} else{ cout << ' '; } cout<<x; } cout << endl; }



//----------------------------------------------------------------
int nmax=200000; // 2*(10^5)
vvec g(nmax);

int n,k;
vec a;

int kkoe;
int ksit;

book check(int mid,vec &sei,vec &hu,int &cnts,int &cnth,int &cntz){
    int kcnt=0;
    if(mid==0){
        kcnt+=cntz*(n-cntz)/2;
        kcnt+=cnts*(cnts-1)/2;
        kcnt+=cnth*(cnth-1)/2;
    }
    else if(mid>0){
        rep(i,cnts){
            int memo=ceil(k,sei[i]);
            k+=sei.end()-lower_bound(all(sei),memo);
        }
        rep(i,cnth){
            int memo=ceil(k,hu[i]);
            k+=hu.end()-lower_bound(all(hu),memo);
        }
    }
    else{
        kcnt+=cntz*(n-cntz)/2;
        rep(i,cnts){
            int memo=k/sei[i];
            k+=upper_bound(all(hu,memo))-hu.begin();
        }
    }
    if()
}


void solve()
{
    
    cin>>n>>k;
    a.resize(n);
    rep(i,n) cin>>a[i];
    vec sei,hu;
    int cnts=0,cnth=0,cntz=0;
    rep(i,n){
        if(a[i]==0) cntz++;
        else if(a[i]<0){
            hu.pb(a[i]*(-1));
            cnth++;
        }
        else{
            sei.pb(a[i]);
            cnts++;
        }
    }
    sort(all(hu));
    sort(all(sei));
    int ng = -INF, ok = INF;
    while (abs(ng-ok)>1) {
      int mid = ng+(ok-ng)/2;
      (check(mid,sei,hu,cnts,cnth,cntz)?ok:ng) = mid;
    }
}
//-----------------------------------------------------------------

signed main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15);
    int repeat = 1;
    // cin >> repeat;
    while(repeat--) solve();
}

Compiler output:
a.cc:78:39: error: macro "all" passed 2 arguments, but takes just 1
   78 |             k+=upper_bound(all(hu,memo))-hu.begin();
      |                                       ^
a.cc:6:9: note: macro "all" defined here
    6 | #define all(x) (x).begin(), (x).end()
      |         ^~~
a.cc:57:1: error: 'book' does not name a type; did you mean 'bool'?
   57 | book check(int mid,vec &sei,vec &hu,int &cnts,int &cnth,int &cntz){
      | ^~~~
      | bool
a.cc: In function 'void solve()':
a.cc:109:8: error: 'check' was not declared in this scope
  109 |       (check(mid,sei,hu,cnts,cnth,cntz)?ok:ng) = mid;
      |        ^~~~~