Submission #66320668

---

Source Code Expand

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

int32_t main() {
    int n;
    cin >> n;
    
    set<int> s;
    
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        s.insert(x);
    }
    
    // Print the count of distinct elements (M)
    cout << s.size() << endl;
    
    // Print the sorted unique elements
    for (auto itr = s.begin(); itr != s.end(); itr++) {
        if (itr != s.begin()) {
            cout << " ";  // Print space before elements (except the first one)
        }
        cout << *itr;
    }
    
    return 0;
}

Submission Info

Judge Result