<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 Node {
public:
    char data;
    int count;

    Node(char d, int c) : data(d), count(c) {}
};

class Compare {
public:
    bool operator()(Node* a, Node* b) { return a->count < b->count; }
};

class Solution {
public:
    string longestDiverseString(int a, int b, int c) {
        priority_queue<Node*, vector<Node*>, Compare> q;

        if (a > 0)
            q.push(new Node('a', a));
        if (b > 0)
            q.push(new Node('b', b));
        if (c > 0)
            q.push(new Node('c', c));

        string ans;

        while (q.size() > 1) {
            Node* first = q.top();
            q.pop();
            Node* second = q.top();
            q.pop();

            if (first->count >= 2) {
                ans += string(2, first->data); // Add two of the same character
                first->count -= 2;
            } else {
                ans += first->data;
                first->count--;
            }

            if (second->count >= 2 && second->count >= first->count) {
                ans += string(2, second->data); // Add two of the same character
                second->count -= 2;
            } else {
                ans += second->data;
                second->count--;
            }

            if (first->count > 0)
                q.push(first);
            if (second->count > 0)
                q.push(second);
        }

        if (!q.empty()) {
            Node* temp = q.top();
            q.pop();
            if (temp->count >= 2) {
                ans += string(2, temp->data); // Add two of the same character
                temp->count -= 2;
            } else {
                ans += temp->data;
                temp->count--;
            }
        }

        return ans;
    }
};
7900