<p>Given an integer array <code>nums</code> that may contain duplicates, return <em>all possible</em> <span data-keyword="subset"><em>subsets</em></span><em> (the power set)</em>.</p>

<p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [1,2,2]
<strong>Output:</strong> [[],[1],[1,2],[1,2,2],[2],[2,2]]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [0]
<strong>Output:</strong> [[],[0]]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
</ul>

class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        int n=nums.size();
        set<vector<int> > ans;
        for(int i=0;i<(1<<n);i++){
            multiset<int> ans1;
            for(int j=0;j<=n;j++){
                if(i & 1<<j){
                    ans1.insert(nums[j]);
                }
            }

            vector<int> ans1_vec;
            for(auto &x: ans1){
                ans1_vec.push_back(x);
            }
            ans.insert(ans1_vec);
        }   

        vector<vector<int> >ans_vec;
        for(auto &x: ans){
            ans_vec.push_back(x);
        }
        return ans_vec;
    }
};
11041