Lista

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

using Z = long long int;

int main() {
    Z n, m;
    cin >> n >> m;

    vector<pair<Z, Z>> lkm(n);
    for(Z i = 0; i < n; ++i) {
        lkm[i].second = i;
    }
    for(Z i = 0; i < m; ++i) {
        Z haku;
        cin >> haku;
        --haku;
        ++lkm[haku].first;
    }
    sort(lkm.rbegin(), lkm.rend());

    for(auto [montax, haku] : lkm) {
        cout << haku + 1 << " ";
    }
    cout << "\n";

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER