题解 | #明明的随机数#

#include <iostream>
#include <vector>
using namespace std;

int main() {
    std::vector<int> numbers;
    int a;
    bool n=true;
    while (cin >> a) { // 注意 while 处理多个 case
        if(n){
            n=false;
            continue;
        }
        bool if_push = true;
        for(int i =0;i < numbers.size();i++){
            if(numbers[i]==a){
                if_push = false;
            }
        }
        if (if_push)numbers.push_back(int(a));
    }
    for(int j = 0;j<=numbers.size() -1;j++){
        bool if_sort = false;
        for(int k = 0;k<numbers.size()-1;k++){
            int c = numbers[k];
            if(numbers[k] > numbers[k+1]){
                numbers[k] = numbers[k+1];
                numbers[k+1]=c;
                if_sort = true;
            }
        }
        if(!if_sort) break;
    }
    for(auto num:numbers){
        std::cout<<num<<std::endl;
    }
}
// 64 位输出请用 printf("%lld")