ACM-冒泡排序

#include <iostream>
#include <vector>
using namespace std;
void Rank(int add[],int n) //冒泡排序
{
    int i,j,num;
    for(i=0;i<n-1;i++){
        for(j=0;j<=n-i-2;j++){
            if(add[j]>add[j+1])
            {
                num = add[j];
                add[j] = add[j+1];
                add[j+1] = num;
            }
        }
    }
}

int main()
{
    int n = 0; 
    int num[1001]={0};
    while(scanf("%d",&n)!=EOF){
    int m = n;
    while(n>0){
        n--;
        scanf("%d",&num[n]);
    }
    Rank(num,m);
    for(int i=0;i<m;i++){
        if(num[i]!=num[i-1])
            cout<<num[i]<<endl;
    }
}
    return 0;
}