| Task: | Lista |
| Sender: | Lieska |
| Submission time: | 2025-11-07 18:14:23 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 100 |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int t[101];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i=1; i<=m; ++i){
int a;
cin >> a;
t[a]++;
}
vector<pair<int, int>> v;
for (int i=1; i<=n; ++i){
v.push_back({t[i], i});
}
sort(v.rbegin(), v.rend());
int ans = 0;
int pos = 1;
vector<int> ans_vec;
for (auto u:v){
ans+=pos*u.first;
ans_vec.push_back(u.second);
pos++;
}
cout << ans << "\n";
for (auto u:ans_vec) cout << u << " ";
cout << "\n";
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 1 1 1 |
| correct output |
|---|
| 1 1 |
| user output |
|---|
| 1 1 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 100 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000 1 100 99 98 97 96 95 94 93 92 ... |
| user output |
|---|
| 1000 1 100 99 98 97 96 95 94 93 92 ... |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 100 1000 1 2 2 2 1 1 1 1 1 1 1 1 1 2 1 ... |
| correct output |
|---|
| 1488 1 2 100 99 98 97 96 95 94 93 9... |
| user output |
|---|
| 1488 1 2 100 99 98 97 96 95 94 93 9... |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 100 1000 7 8 2 4 8 3 3 10 9 7 7 6 8 7 2... |
| correct output |
|---|
| 5109 3 8 7 5 1 6 2 4 9 10 100 99 98... |
| user output |
|---|
| 5109 3 8 7 5 1 6 2 4 9 10 100 99 98... |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 100 1000 23 85 3 99 63 79 38 37 67 28 7... |
| correct output |
|---|
| 41714 57 38 63 62 93 85 95 81 79 61 ... |
| user output |
|---|
| 41714 57 38 63 62 93 85 95 81 79 61 ... |
