<p>You are given <code>m</code> <code>arrays</code>, where each array is sorted in <strong>ascending order</strong>.</p>

<p>You can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the distance between two integers <code>a</code> and <code>b</code> to be their absolute difference <code>|a - b|</code>.</p>

<p>Return <em>the maximum distance</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> arrays = [[1,2,3],[4,5],[1,2,3]]
<strong>Output:</strong> 4
<strong>Explanation:</strong> One way to reach the maximum distance 4 is to pick 1 in the first or third array and pick 5 in the second array.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> arrays = [[1],[1]]
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m == arrays.length</code></li>
	<li><code>2 &lt;= m &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= arrays[i].length &lt;= 500</code></li>
	<li><code>-10<sup>4</sup> &lt;= arrays[i][j] &lt;= 10<sup>4</sup></code></li>
	<li><code>arrays[i]</code> is sorted in <strong>ascending order</strong>.</li>
	<li>There will be at most <code>10<sup>5</sup></code> integers in all the arrays.</li>
</ul>

class Solution {
    using pii = pair<int, int>;
public:
    int maxDistance(vector<vector<int>>& arrays) {
        vector<pii> se;
        for (auto &a: arrays) {
            se.emplace_back(a[0], a[a.size() - 1]);
        }
        sort(se.begin(), se.end());
        int lastStart = se[0].first, lastEnd = se[0].second;
        int maxV = 0;
        for (int i = 1; i < se.size(); ++i) {
            int curStart = se[i].first, curEnd = se[i].second;
            maxV = max(maxV, max(abs(lastEnd - curStart), abs(curEnd - lastStart)));

            lastStart = min(lastStart, curStart);
            lastEnd = min(lastEnd, curEnd);
        }
        return maxV;
    }
};

// [[-1,1],[-3,1,4],[-2,-1,0,2]]

// -3 4
// -2 2
// -1 1
113066