在C/C++中按出现频率对数组排序

struct Element {
    int value;
    int frequency;
};

unordered_map<int, int> frequencyMap;
for (int i = 0; i < arraySize; i++) {
    frequencyMap[array[i]]++;
}

vector<Element> elements;
for (const auto& pair : frequencyMap) {
    elements.push_back({ pair.first, pair.second });
}

bool compare(const Element& a, const Element& b) {
    return a.frequency > b.frequency;
}

sort(elements.begin(), elements.end(), compare);

for (const auto& element : elements) {
    cout << "元素：" << element.value << "，出现频率：" << element.frequency << endl;
}