Lista

#include <bits/stdc++.h>
 
#define ll long long

using namespace std;
 
int main () {
    int n, m;
    cin>>n>>m;
    ll cnt[n + 1];
    for (int i = 0; i <= n; i++) {
        cnt[i] = 0;
    }
    for (int i = 0; i < m; i++) {
        int x;
        cin>>x;
        cnt[x]++;
    }
    cnt[0] = m + 1;
    vector<pair<ll, int>> v;
    for (int i = 1; i <= n; i++) {
        v.push_back({cnt[i], i});
    }
    sort(cnt, cnt + (n + 1));
    reverse(cnt, cnt + (n + 1));
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    ll ans = 0;
    for (ll i = 0; i <= n; i++) {
        ans += i * cnt[i];
    }
    cout<<ans<<endl;
    for (int i = 0; i < n; i++) {
        cout<<v[i].second<<" ";
    }
    cout<<endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED