Tikut

input/code.cpp: In function 'void solve()':
input/code.cpp:40:17: error: 'solve2' was not declared in this scope; did you mean 'solve'?
   40 |     if (m <= 2) solve2();
      |                 ^~~~~~
      |                 solve
input/code.cpp: In function 'int main()':
input/code.cpp:163:17: error: 'solve3' was not declared in this scope; did you mean 'solve2'?
  163 |     while (t--) solve3();
      |                 ^~~~~~
      |                 solve2

#include <bits/stdc++.h>

#define MODE 0

#if MODE
#define debug(x) cout << #x << ": " << (x) << endl
#define log(x) cout << (x) << endl
#define test(x) x
#else
#define debug(x)
#define log(x)
#define test(x)
#endif

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define X real()
#define Y imag()

using namespace std;
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using P = complex<ll>;

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const ll M = 1000000007; // 998244353

void solve() {
    int n, m;
    cin >> n >> m;
    
    if (m <= 2) solve2();
    
    priority_queue<array<int, 5>> pq, pq2;
    int minl = 1e9;
    vector<int> cur(n);
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        chmin(minl, a);
        cur[i] = 2;
        pq.push({a, a/2, a, 2, i});
        pq2.push({a/2, a, a, 2, i});
    }
    
    for (int i = 0; i < m; ++i) {
        auto a = pq.top();
        pq.pop();
        
        log("");
        debug(a[0]);
        debug(a[1]);
        debug(a[2]);
        debug(a[3]);
        debug(a[4]);
        
        if (a[0] - minl < (pq.size() ? max(pq.top()[0], (a[2] - 1) / a[3] + 1) : (a[2] - 1) / a[3] + 1) - min(minl, a[2] / a[3])) {
            debug("here");
            while (pq2.size() && pq2.top()[0] >= minl) {
                if (pq2.top()[3] != cur[pq2.top()[4]]) pq2.pop();
                else {
                    pq.push(a);
                    a = pq2.top();
                    pq2.pop();
                    swap(a[0], a[1]);
                    break;
                }
            }
        }
        
        log("");
        debug(a[0]);
        debug(a[1]);
        debug(a[2]);
        debug(a[3]);
        debug(a[4]);
        
        chmin(minl, a[2] / a[3]);
        
        cur[a[4]] = a[3] + 1;
        pq.push({(a[2] - 1) / a[3] + 1, a[2] / (a[3] + 1), a[2], a[3] + 1, a[4]});
        pq2.push({a[2] / (a[3] + 1), (a[2] - 1) / a[3] + 1, a[2], a[3] + 1, a[4]});
        log("");
        debug((a[2] - 1) / a[3] + 1);
        debug(a[2] / (a[3] + 1));
        debug(a[2]);
        debug(a[3] + 1);
        debug(a[4]);
        
        while (pq.size() && pq.top()[3] != cur[pq.top()[4]]) pq.pop();
        cout << pq.top()[0] - minl << " \n"[i == m-1];
    }
}

void solve2(int n, int m) {
    vector<int> a(n);
    for (int &i : a) cin >> i;
    
    sort(all(a));
    
    int ans = 2e9;
    for (int i = 0; i < n; ++i) if (a[i] >= 2) {
        int minl = 2e9, maxl = 0;
        if (n >= 2) {
            minl = i == 0 ? a[1] : a[0];
            maxl = i == n-1 ? a[n-2] : a[n-1];
        }
        chmin(minl, a[i]/2);
        chmax(maxl, (a[i]-1)/2+1);
        chmin(ans, maxl - minl);
    }
    
    cout << ans << ' ';
    ans = 2e9;
    
    if (m == 2) {
        for (int i = 0; i < n; ++i) if (a[i] >= 2) {
            if (a[i] >= 3) {
                int minl = 2e9, maxl = 0;
                if (n >= 2) {
                    minl = i == 0 ? a[1] : a[0];
                    maxl = i == n-1 ? a[n-2] : a[n-1];
                }
                chmin(minl, a[i]/3);
                chmax(maxl, (a[i]-1)/3+1);
                chmin(ans, maxl - minl);
            }
            for (int j = i+1; j < n; ++j) if (a[j] >= 2) {
                int minl = 2e9, maxl = 0;
                if (n >= 3) {
                    if (i == 0 && j == 1) minl = a[2];
                    else if (i == 0) minl = a[1];
                    else minl = a[0];
                    if (i == n-2 && j == n-1) maxl = a[n-3];
                    else if (j == n-1) maxl = a[n-2];
                    else maxl = a[n-1];
                }
                chmin(minl, a[i]/2);
                chmax(maxl, (a[i]-1)/2+1);
                chmin(minl, a[j]/2);
                chmax(maxl, (a[j]-1)/2+1);
                chmin(ans, maxl - minl);
            }
        }
        cout << ans << ' ';
    }
    cout << '\n';
}

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    
    int t = 1;
    if (t == 0) cin >> t;
    while (t--) solve3();
    
    return 0;
}