首页 > ACM题库 > 九度OJ > 九度-1041-Simple Sorting[解题代码]
2013
12-12

九度-1041-Simple Sorting[解题代码]

题目来源:2008年上海交通大学计算机研究生机试真题

题目描述:

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

cpp 代码如下:
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int arr[1001];
int main(){
	int n,i;
	while( cin >> n)
	{
		for(i=0; i<n; i++)
			cin >> arr[i];
		sort(arr,arr+n);
		cout << arr[0];
		for(i=1; i<n; i++)
		{
			if(arr[i] != arr[i-1])
				cout << " " << arr[i];
		}
		cout << endl;
	}

	return 0;
};
/**************************************************************
	Problem: 1041
	User: coder
	Language: C++
	Result: Accepted
	Time:0 ms
	Memory:1524 kb
****************************************************************/