记录一个错误，我不知为什么错了

力扣

除了官方解法以外，我是用这种思路，出现问题在队列中使用pair<string,string>进行排序的时候，这段代码在输入数据都是个位数的时候成功运行；就是在位数不为零的时候出错；明天再看到底什么问题；

#include<iostream>
#include<vector>
#include<queue>
#include<string>
#include<unordered_map>
using namespace std;
bool cmp(int n1, int n2)
{
    return to_string(n1)[0] < to_string(n2)[0];
}
bool cmp1(pair<string, string> P1, pair<string, string> P2)
{
    return P2.second > P1.second;
}

class Solution {
public:

    string largestNumber(vector<int>& nums) {
        priority_queue<int, vector<int>, decltype(&cmp)> que(cmp);
        vector<int> cnt(10, 0);
        vector<int> max_L(10, 0);
        string res = "";
        for (int i = 0; i < nums.size(); i++)
        {
            int cur = nums[i];
            que.push(cur);
            int idx = int(to_string(nums[i])[0] - '0');
            cnt[idx]++;
            max_L[idx] = max(max_L[idx], int(to_string(nums[i]).size()));
        }


        for (int j = 9; j >= 0; j--)
        {
            int len = max_L[j];
            priority_queue<pair<string, string>, vector<pair<string, string>>, decltype(&cmp1)> que1;
            for (int k = 0; k < cnt[j]; k++)
            {
                int cur = que.top();
                que.pop();
                if (to_string(cur).size() < len)
                {
                    int M = len - to_string(cur).size();
                    string s = to_string(cur);
                    while (M--)
                        s += "0";
                    que1.emplace(to_string(cur), s);
                }

                else
                    que1.emplace(to_string(cur), to_string(cur));
            }

            while (!que1.empty())
            {
                res += que1.top().first;
                que1.pop();
            }
        }

        return res;
    }
};

int main()
{
    vector<int> nums = { 3,30,34,9,5 };
    Solution S;
    cout << S.largestNumber(nums) << endl;
    return 0;
}