3477. Simple sorting

Given an inclusion n Array of integers , Please delete the duplicate elements in the array and sort the array from small to large and output .

Input format

The first line contains an integer n.

The second line contains n No more than one. 1000 The positive integer .

Output format

Output the array after de duplication and sorting .

Data range

1≤n≤1000

sample input ：

6
8 8 7 3 7 7

sample output ：

3 7 8

set：

#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>

using namespace std;

int main()
{
    
    int n;
    cin >> n;

    set<int> S;
    while (n--)
    {
    
        int x;
        cin >> x;
        S.insert(x);
    }

    for (auto x : S)
        cout << x << ' ';
    return 0;
}

use unique function :

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;

int q[N];

int main()
{
    
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> q[i];
    sort(q, q + n);

    n = unique(q, q + n) - q;

    for (int i = 0; i < n; i++)
        cout << q[i] << ' ';

    return 0;
}

Code ：

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;

int q[N];

int main()
{
    
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> q[i];
    sort(q, q + n);

    int j = 1;
    for (int i = 1; i < n; i++)
        if (q[i] != q[i - 1])
            q[j++] = q[i];

    for (int i = 0; i < j; i++)
        cout << q[i] << ' ';

    return 0;
}