感觉不如……

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

class cmp
{
    public:
        bool operator()(const int v1,const int v2) const
        {
            return v1<v2;
        }
};
set<int,cmp> p;

int main()
{
    int a;
    while(cin >> a) p.insert(a);
    //sort(p.begin(),p.end());
    for(auto x:p) cout << x << " ";
    return 0;
}

C++

冒泡好麻烦 还得是桶排

#include <bits/stdc++.h>
using namespace std;
int main(){
    int a[100];
    int x;
    while(cin >> x) {
        a[x] = 1;
    }
    for(int i = 0; i < 100; i++) {
        if(a[i]) cout << i << " ";
    }
    return 0;
}

奇技淫巧

a=list(map(int,input().split(" ")))
a=list(set(a))
a.sort()
for i in a:
    print(i,end=" ")

a=list(map(int,input().split()))
n=len(a)
bottom=n-1
for i in range(1,n):
    for j in range(bottom,i-1,-1):
        if a[j]<a[j-1]:
            a[j],a[j-1]=a[j-1],a[j]
        elif a[j]==a[j-1]:
            a[j]=a[bottom]
            bottom-=1
for i in range(bottom+1):
    print(a[i],end=" ")

a=list(map(int,input().split()))
n=len(a)
b=[]
bottom=n-1
for i in range(1,n):
    for j in range(bottom,i-1,-1):
        if a[j]<a[j-1]:
            a[j],a[j-1]=a[j-1],a[j]
        elif a[j]==a[j-1]:
            a[j]=a[bottom]
            bottom-=1
for i in range(bottom+1):
    print(a[i],end=" ")