<p>You are given a 2D integer array <code>intervals</code> where <code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> represents all the integers from <code>start<sub>i</sub></code> to <code>end<sub>i</sub></code> inclusively.</p>

<p>A <strong>containing set</strong> is an array <code>nums</code> where each interval from <code>intervals</code> has <strong>at least two</strong> integers in <code>nums</code>.</p>

<ul>
	<li>For example, if <code>intervals = [[1,3], [3,7], [8,9]]</code>, then <code>[1,2,4,7,8,9]</code> and <code>[2,3,4,8,9]</code> are <strong>containing sets</strong>.</li>
</ul>

<p>Return <em>the minimum possible size of a containing set</em>.</p>

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

<pre>
<strong>Input:</strong> intervals = [[1,3],[3,7],[8,9]]
<strong>Output:</strong> 5
<strong>Explanation:</strong> let nums = [2, 3, 4, 8, 9].
It can be shown that there cannot be any containing array of size 4.
</pre>

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

<pre>
<strong>Input:</strong> intervals = [[1,3],[1,4],[2,5],[3,5]]
<strong>Output:</strong> 3
<strong>Explanation:</strong> let nums = [2, 3, 4].
It can be shown that there cannot be any containing array of size 2.
</pre>

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

<pre>
<strong>Input:</strong> intervals = [[1,2],[2,3],[2,4],[4,5]]
<strong>Output:</strong> 5
<strong>Explanation:</strong> let nums = [1, 2, 3, 4, 5].
It can be shown that there cannot be any containing array of size 4.
</pre>

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

<ul>
	<li><code>1 &lt;= intervals.length &lt;= 3000</code></li>
	<li><code>intervals[i].length == 2</code></li>
	<li><code>0 &lt;= start<sub>i</sub> &lt; end<sub>i</sub> &lt;= 10<sup>8</sup></code></li>
</ul>

class Solution {
public:
    int intersectionSizeTwo(vector<vector<int>>& intervals) {
        priority_queue<pair<int,int>> pq;
        vector<int> taken;
        for(int i=0;i<intervals.size();i++){
            pq.push({intervals[i][0], i});
        }
        while(!pq.empty()){
            int i = pq.top().second;
            int pos = pq.top().first;
            pq.pop();
            int a = intervals[i][0];
            int b = intervals[i][1];
            int counter = 0;
            for(int j=((int)taken.size())-1;j>=0;j--){
                int v = taken[j];
                counter += a <= v && v <= b;
                if(v>b || counter>=2)break;
            }
            printf("%d %d: %d\n", a, b, counter);
            if(counter==2)continue;
            if(counter==1){
                if(taken.back() == a){
                    taken.pop_back();
                    taken.push_back(a+1);
                    taken.push_back(a);
                }else{
                    taken.push_back(a);
                }
            }else{
                taken.push_back(a+1);
                taken.push_back(a);
            }
        }
        return taken.size();
    }
};
22600