Simple Sort

标签：element   cout   namespace   kill   asc   ssi   most   eve   output   

题目描述

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.

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

int main(){
    int a[1000], b[1000];
    int n;
    while(cin >> n){
        for(int i = 0; i < n; i++){
            cin >> a[i];
        }
        sort(a, a + n);
        b[0] = a[0];
        int k = 1;
        for(int i = 1; i < n; i++){
            if(a[i] > a[i - 1]) {
                b[k] = a[i];
                k++;
            }
        }
        for(int i = 0; i < k; i++){
            cout << b[i] << " ";
        }
    }
    return 0;
}

Simple Sort

标签：element   cout   namespace   kill   asc   ssi   most   eve   output   

原文地址：https://www.cnblogs.com/zhuobo/p/10209016.html