Banquet Preparations 1（数学推导，贪心）

#include <bits/stdc++.h>
using namespace std;
#define db double
#define ll long long
#define pii pair<int,int>
#define rush() int Te; cin >> Te; while (Te--)
const int N = 2e5 + 5;
const int M = (N << 2);
const int P = 1e9 + 7;
ll n, m, T, Tres, A, B, C, D, l, r, x, add, a[N], b[N];
int main()
{
    rush() {
        cin >> n >> m;
        A = 0, B = 0, T = 0;
        for (int i = 1; i <= n; i ++) {
            cin >> a[i] >> b[i];
            A += min(a[i], m);
            B += min(b[i], m);
            T += a[i] - b[i];
        }
        C = n * m - A;
        D = n * m - B;
        l = T - A + C;
        r = T - D + B;
        if ((l >= 0 && r >= 0) || (l <= 0 && r <= 0)) {
            Tres = min(abs(l), abs(r));
            if (Tres) if (l < 0) Tres = -Tres;
        } else {
            if (l % 2) Tres = 1;
            else Tres = 0;
        }
        cout << abs(Tres) << endl;
        x = (T - Tres + n * m) / 2;
        for (int i = 1; i <= n; i ++) {
            x -= max(m - b[i], 0ll);
        }
        for (int i = 1; i <= n; i ++) {
            add = min(x, min(m - max(m - b[i], 0ll), a[i] - max(m - b[i], 0ll)));
            x -= add;
            ll fish = max(m - b[i], 0ll) + add;
            cout << fish << " " << m - fish << endl;
        }
    }
    return 0;
}