题解 | #明明的随机数#

#include <algorithm>
using namespace std;

int main()
{
    int n; //随机数个数n
    int num; //每次的输入数据
    int data[1000] = { 0 };
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &num);
        data[i] = num;
        //cout << data[i] << endl;
    }
    //排序
    //sort(data, data+n);
    //冒泡排序
    int temp;
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = 0; j < n - 1 - i; j++)
        {
            if (data[j] > data[j+1])
            {
                temp = data[j];
                data[j] = data[j+1];
                data[j + 1] = temp;
            }
        }
    }

    //去重
    int nn = unique(data, data+n) - data;
    for(int i = 0; i < nn; i++)
        cout << data[i] << endl;
}