Simple Sorting

                                                    Simple Sorting

时间限制(普通/Java):1000MS/3000MS          运行内存限制:65536KByte
总提交:18            测试通过:8

描述

You are given an unsorted array of integer numbers. Your task is to sort this array and kill possible duplicated elements occurring in it.

输入

For each case, the first line of the input contains an integer number N representing the quantity of numbers in this array(1≤N≤1000). Next N lines contain N integer numbers(one number per each line) of the original array.

输出

For each case ,outtput file should contain at most N numbers sorted in ascending order. Every number in the output file should occur only once.

样例输入

6
8 8 7 3 7 7

样例输出

3 7 8

​
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int a[1005],b[1005];
bool cmp(int n,int m)
{
    return n<m;
}
int main()
{
    int k,i,j;
    while(~scanf("%d",&k))
    {
        j=1;
        for(i=0;i<k;i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a,a+k,cmp);
        b[0]=a[0];
        for(i=1;i<k;i++)
        {
            if(a[i]!=a[i-1])
            {
                b[j++]=a[i];
            }
        }
        for(i=0;i<j;i++)
        {
            if(i!=j-1)
            printf("%d ",b[i]);
            else
                printf("%d\n",b[j-1]);
        }
    }
}

​