Lista

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

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n,m; cin>>n>>m;
    map<int,int> M;
    for (int i=0; i<m; i++) {
        int x; cin>>x;
        M[x]++;
    }
    vector<int> V(n);
    for (int i=0; i<n; i++) V[i]=i+1;
    sort(V.begin(), V.end(), [&](int x, int y) {
        return M[x] > M[y];
    });
    long long cost=0;
    for (int i=0; i<n; i++) {
        cost += (i+1) * M[V[i]];
    }
    cout << cost << '\n';
    for (int i=0; i<n; i++) {
        cout << V[i] << "\n "[i+1<n];
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED