Lista

#include <algorithm>
#include <iostream>
#include <numeric>
using namespace std;

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

	int c[n] {}, ii[n] {};
	for (int i = 0; i < m; ++i) {
		int x;
		cin >> x;
		x--;
		c[x]++;
	}

	iota(ii, ii + n, 0);
	sort(ii, ii + n, [&](int l, int r) { return c[l] > c[r]; });

	long s = 0;
	for (int i = 0; i < n; ++i)
		s += (i + 1) * c[ii[i]];

	cout << s << endl;
	for (int i = 0; i < n; ++i)
		cout << ii[i] + 1 << " \n"[i + 1 == n];
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED