优先队列贪心

 

 

class Solution {
public:

struct cmp
{
    bool operator()(string a,string b)
    {
        return a+b>b+a;
    }
};


    string minNumber(vector<int>& nums) {
        priority_queue<string,vector<string>,cmp>q;
        for(int i=0;i<nums.size();i++)
        {
            string s=to_string(nums[i]);
            q.push(s);
        }
        string res;
        while(!q.empty())
        {
            res+=q.top();
            q.pop();
        }
        return res;
    }
};