<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 {
public:
    int maxDistance(vector<vector<int>>& arrays) {
        vector<int> minValues;
        vector<int> maxValues;
        int k1 = 0;
        int l1 = 0;
        for(int i = 0; i < arrays.size(); i++) {
            vector<int>& m = arrays[i];
            maxValues.push_back(m[m.size() - 1]);
            minValues.push_back(m[0]);
        }

        vector<int> cmin = minValues;
        vector<int> cmax = maxValues;
        sort(cmin.begin(), cmin.end());
        sort(cmax.begin(), cmax.end());

        int min1 = cmin[0];
        int min2 = cmin[1];
        int max1 = cmax[cmax.size() - 1];
        int max2 = cmax[cmax.size() - 2];

       
        for(int i = 0; i < maxValues.size(); i++) {
            if(max1 == maxValues[i]) {
                l1 = i;
            }
        }

        for(int i = 0; i < minValues.size(); i++) {
            if(min1 == minValues[i]) {
                k1 = i;
            }
        }

        if(l1 != k1) {
            return max1 - min1;
        } else {
            if(max2 - min1 > max1 - min2)
            {
                return max2 - min1 ;
            }
            else{
                return max1 - min2;
            }
        }
    }
};
115674