<p>A string <code>s</code> is called <strong>happy</strong> if it satisfies the following conditions:</p>

<ul>
	<li><code>s</code> only contains the letters <code>&#39;a&#39;</code>, <code>&#39;b&#39;</code>, and <code>&#39;c&#39;</code>.</li>
	<li><code>s</code> does not contain any of <code>&quot;aaa&quot;</code>, <code>&quot;bbb&quot;</code>, or <code>&quot;ccc&quot;</code> as a substring.</li>
	<li><code>s</code> contains <strong>at most</strong> <code>a</code> occurrences of the letter <code>&#39;a&#39;</code>.</li>
	<li><code>s</code> contains <strong>at most</strong> <code>b</code> occurrences of the letter <code>&#39;b&#39;</code>.</li>
	<li><code>s</code> contains <strong>at most</strong> <code>c</code> occurrences of the letter <code>&#39;c&#39;</code>.</li>
</ul>

<p>Given three integers <code>a</code>, <code>b</code>, and <code>c</code>, return <em>the <strong>longest possible happy </strong>string</em>. If there are multiple longest happy strings, return <em>any of them</em>. If there is no such string, return <em>the empty string </em><code>&quot;&quot;</code>.</p>

<p>A <strong>substring</strong> is a contiguous sequence of characters within a string.</p>

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

<pre>
<strong>Input:</strong> a = 1, b = 1, c = 7
<strong>Output:</strong> &quot;ccaccbcc&quot;
<strong>Explanation:</strong> &quot;ccbccacc&quot; would also be a correct answer.
</pre>

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

<pre>
<strong>Input:</strong> a = 7, b = 1, c = 0
<strong>Output:</strong> &quot;aabaa&quot;
<strong>Explanation:</strong> It is the only correct answer in this case.
</pre>

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

<ul>
	<li><code>0 &lt;= a, b, c &lt;= 100</code></li>
	<li><code>a + b + c &gt; 0</code></li>
</ul>

class compare{
  public:
  bool operator()(pair<char,int>a ,pair<char,int>b){
      return a.second<b.second;
  }  
};

class Solution {
public:
    string longestDiverseString(int a, int b, int c) {
        priority_queue<pair<char,int>, vector<pair<char,int>>, compare> maxHeap;

        if(a>0){
            pair<char,int> p= make_pair('a',a);
            maxHeap.push(p);
        }
        if(b>0){
            pair<char,int> p= make_pair('b',b);
            maxHeap.push(p);
        }
        if(c>0){
            pair<char,int> p= make_pair('c',c);
            maxHeap.push(p);
        }

        string ans="";

        while(maxHeap.size()>1){
            pair<char,int> firstMax= maxHeap.top();
            maxHeap.pop();
            pair<char,int> secondMax= maxHeap.top();
            maxHeap.pop();

            if(firstMax.second>=2){
                ans.push_back(firstMax.first);
                ans.push_back(firstMax.first);
                firstMax.second-= 2;
            }
            else{
                ans.push_back(firstMax.first);
                firstMax.second--;
            }

            if(secondMax.second>=2 && secondMax.second>=firstMax.second){
                ans.push_back(secondMax.first);
                ans.push_back(secondMax.first);
                secondMax.second-= 2;
            }
            else{
                ans.push_back(secondMax.first);
                secondMax.second--;
            }

            if(firstMax.second>0){
                maxHeap.push(firstMax);
            }
            if(secondMax.second>0){
                maxHeap.push(secondMax);
            }

        }

        if(maxHeap.size()==1){
           pair<char,int> first= maxHeap.top();
           maxHeap.pop();

           if(first.second>=2){
                ans.push_back(first.first);
                ans.push_back(first.first);
                first.second-= 2;
            }
            else{
                ans.push_back(first.first);
                first.second--;
            }

        }
        return ans;
    }
};
7700