2994. 数组排序

        for(int i = 0; i < n; i++)
        {
            int temp;
            cin >> temp;
            a[temp]++;
        }
        int cnt = 0;
        cout << "case #" << q << ':'<< endl;
        while(cnt < n)
        {
            int max = 0,maxindex = 0;
            for(int i = 0; i < 500; i++)
            {
                if(a[i] > max)
                {
                    maxindex = i;//maxindex是出现次数最多的元素的下标
                    max = a[i]; // max是出现次数最多的元素的出现次数
                }
            }
            for(int i = 0; i < max; i++,cnt++)
            {
                cout << maxindex;
                if (cnt != n - 1)
                    cout << ' ';
                else
                    cout << endl;
            }
            a[maxindex] = -1;//由最大变最小
        }
    }




return 0;

N = int(input())
for case_n in range(N):
    num = int(input())
    ans = list(map(int, input().split()))

    counts = {}

    for item in ans:
        counts[item] = counts[item] + 1 if item in counts else 0

    ans = sorted(ans, key=lambda x: (-counts[x], x))

    print(f"case #{case_n}:")
    print(" ".join(map(str,ans)))

#include <algorithm>
#include <cstdint>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    uint32_t t;
    cin >> t;
    for (uint32_t query = 0; query < t; ++query) {
        struct Num {
            uint32_t val;
            uint32_t cnt;
            bool operator==(uint32_t val) const { return val == this->val; }
        };
        vector<Num> nums;
        uint32_t n; cin >> n;
        for (uint32_t i = 0; i < n; ++i) {
            uint32_t temp; cin >> temp;
            auto ptr = find(nums.begin(), nums.end(), temp);
            if (ptr == nums.end())
                nums.push_back({temp, 1});
            else
                ++ptr->cnt;
        }
        sort(nums.begin(), nums.end(), [](Num a, Num b) {
            if (a.cnt == b.cnt)
                return a.val < b.val;
            return a.cnt > b.cnt;
        });
        cout << "case #" << query << ":\n";
        for (auto i : nums)
            for (uint32_t j = 0; j < i.cnt; ++j)
                cout << i.val << ' ';
        cout.put('\n');
    }
}