Lista

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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

  vector<int> reqs(m);
  for (int i = 0; i < m; i++) cin>>reqs[i];
  sort(reqs.begin(), reqs.end());

  
  vector<pair<int, int>> batches;
  for (int i = 0, j = 0; i < m; i = j) {
    while (j < m && reqs[i] == reqs[j]) j++;
    batches.push_back({j - i, reqs[i]});
  }
  
  sort(batches.begin(), batches.end());
  reverse(batches.begin(), batches.end());
  
  vector<int> nums;
  
  int ans = 0, curidx = 1;
  for (auto [cnt, v] : batches) {
    ans += cnt * curidx;
    curidx++;
    nums.push_back(v);
  }

  for (int i = 1; i <= n; i++) {
    bool f = false;
    for (int v : nums) f |= v == i;
    if (!f) nums.push_back(i);
  }

  cout << ans << "\n";
  for (int v : nums) cout << v << " ";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED