| Task: | Lista |
| Sender: | Laakeri |
| Submission time: | 2025-11-07 20:33:17 +0200 |
| Language: | C++ (C++11) |
| 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;
int cnt[1010];
int main(){
int n,m;
cin>>n>>m;
for (int i=0;i<m;i++){
int a;
cin>>a;
cnt[a]++;
}
vector<pair<int,int>> lol;
for (int i=1;i<=n;i++){
lol.push_back({cnt[i], i});
}
sort(lol.rbegin(), lol.rend());
int ans=0;
for (int i=1;i<=n;i++){
ans+=i*lol[i-1].first;
}
cout<<ans<<endl;
for (int i=1;i<=n;i++){
cout<<lol[i-1].second<<" ";
}
cout<<endl;
}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 ... |
