<p>You are given a <strong>0-indexed</strong> 2D integer array <code>flowers</code>, where <code>flowers[i] = [start<sub>i</sub>, end<sub>i</sub>]</code> means the <code>i<sup>th</sup></code> flower will be in <strong>full bloom</strong> from <code>start<sub>i</sub></code> to <code>end<sub>i</sub></code> (<strong>inclusive</strong>). You are also given a <strong>0-indexed</strong> integer array <code>people</code> of size <code>n</code>, where <code>people[i]</code> is the time that the <code>i<sup>th</sup></code> person will arrive to see the flowers.</p>

<p>Return <em>an integer array </em><code>answer</code><em> of size </em><code>n</code><em>, where </em><code>answer[i]</code><em> is the <strong>number</strong> of flowers that are in full bloom when the </em><code>i<sup>th</sup></code><em> person arrives.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/02/ex1new.jpg" style="width: 550px; height: 216px;" />
<pre>
<strong>Input:</strong> flowers = [[1,6],[3,7],[9,12],[4,13]], people = [2,3,7,11]
<strong>Output:</strong> [1,2,2,2]
<strong>Explanation: </strong>The figure above shows the times when the flowers are in full bloom and when the people arrive.
For each person, we return the number of flowers in full bloom during their arrival.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/02/ex2new.jpg" style="width: 450px; height: 195px;" />
<pre>
<strong>Input:</strong> flowers = [[1,10],[3,3]], people = [3,3,2]
<strong>Output:</strong> [2,2,1]
<strong>Explanation:</strong> The figure above shows the times when the flowers are in full bloom and when the people arrive.
For each person, we return the number of flowers in full bloom during their arrival.
</pre>

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

<ul>
	<li><code>1 &lt;= flowers.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>flowers[i].length == 2</code></li>
	<li><code>1 &lt;= start<sub>i</sub> &lt;= end<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
	<li><code>1 &lt;= people.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>1 &lt;= people[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    vector<int> fullBloomFlowers(vector<vector<int>>& flowers, vector<int>& people) {
        // step 1: make map
        map<int,int>mp;
        for(int i=0;i<flowers.size();i++)
        {
            int x=flowers[i][0];
            int y=flowers[i][1];
            mp[x]++;
            mp[y+1]--;
        }
        int sum=0;

        // step 2: copy people array and sort
        vector<int>copy;
        for(int i=0;i<people.size();i++)
        copy.push_back(people[i]);
        sort(copy.begin(),copy.end());
        int pointer1=0;
        //this map is store answer 
        //suppose people[x] answer is y then ans[people[x]]=y
        map<int,int>ans;

        // step 3: visit map and find answer
        for(auto x:mp)
        {
            if(pointer1<copy.size() && x.first<copy[pointer1])
            {
            sum+=x.second;
            }
            else if(pointer1<copy.size() && x.first==copy[pointer1])
            {
                sum+=x.second;
                ans[copy[pointer1]]=sum;
                pointer1++;
            }
            else if(pointer1<copy.size() && x.first>copy[pointer1])
            {
                ans[copy[pointer1]]=sum;
                pointer1++;
                while(pointer1<copy.size() && x.first>copy[pointer1])
                {
                    ans[copy[pointer1]]=sum;
                    pointer1++;
                }
                sum+=x.second;
            }
        }

        // step 4: make final answer array
        vector<int>final_ans;
        for(int i=0;i<people.size();i++)
            final_ans.push_back(ans[people[i]]);
        return final_ans;
    }
};
103581