Lista

#include <bits/stdc++.h>

#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using namespace std;
using ll = long long;

const int inf = 1e9;
const ll LLInf = 1e18;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m;
    cin >> n >> m;

    vector<pair<int, int>> a(n);
    for (int i = 1; i <= n; ++i) {
        a[i - 1] = {0, i};
    }

    vector<int> am(n + 1);
    while (m--) {
        int x; cin >> x;
        a[x - 1].first++;
        am[x]++;
    }

    sort(rbegin(a), rend(a));

    int ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += (i + 1) * am[a[i].second];
    }

    cout << ans << "\n";
    for (auto [_, x] : a) cout << x << " ";
    cout << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED