Lista

#include <iostream>
#include <algorithm>

using namespace std;

struct Num {
    int N;
    int C;
};

bool numdesc(const Num& a, const Num& b) { return a.C > b.C; }

int main()
{
    int nums;
    int tests;
    Num* lus;

    cin >> nums;
    cin >> tests;

    lus = new Num[nums];
    for (int i = 0; i < nums; i++) {
        Num nn;
        nn.C = 0;
        nn.N = i + 1;
        lus[i] = nn;
    }

    int test;
    for (int i=0;i<tests; i++) {
        cin >> test;
        lus[test - 1].C++;
    }

    sort(lus, lus+nums, numdesc);

    int effort = 0;
    for (int i = 0; i < nums; i++) {
        Num nn = lus[i];
        if (nn.C == 0) break;
        effort += (i + 1) * nn.C;
    }
    cout << effort << endl;
    for (int i = 0; i < nums; i++) {
        if (i) { cout << ' '; }
        cout << lus[i].N;
    }
    cout << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED