Easy priority queue solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    string clearStars(string s) {\n        priority_queue<pair<char,int>,vector<pair<char,int>>,greater<pair<char,int>>> pq;\n        int n = s.size();\n        int starCnt = 0;\n        for(int i = 0;i<n;i++){\n            if(s[i] != \'*\'){\n                pq.push({s[i],-i});\n            }else{\n                char ch = pq.top().first;\n                int index = -pq.top().second;\n                pq.pop();\n                s[i] = s[index] = \'#\';\n            }\n        }\n        string ans = "";\n        for(int i = 0;i<n;i++){\n            if(s[i] != \'#\'){\n                ans += s[i];\n            }\n        }\n        return ans;\n    }\n};\n```
['String', 'Heap (Priority Queue)', 'C++']