题解 | 明明的随机数

#include <iostream>
#include <stdio.h>
#include "stdlib.h"
#include "string"
#include "vector"
#include "algorithm"

int main() {
    int n = 0;
    scanf("%d", &n);
    std::vector<int> arr;
    int a = 0;
    for(int i = 0; i < n; i++){
        scanf("%d", &a);
        if(arr.size() == 0){
            arr.push_back(a);
        }
        else{
            auto res = std::find(arr.begin(), arr.end(), a);
            if(res == arr.end())
            {
                arr.push_back(a);
            }
        }
    }

    std::sort(arr.begin(), arr.end(), [](int a, int b){
        return a < b;
    });

    for(int i = 0; i < arr.size(); i++)
    {
        std::cout << arr[i] << "\n";
    }
}