题目1041:Simple Sorting
时间限制:
1 秒
内存限制:
32 兆
特殊判题:
否
提交:
2365
解决:
923
题目描述:
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
来源:
2008年上海交通大学计算机研究生机试真题
//jobdu1041
//
#include<iostream>
using namespace std;
#include<new>
#include<algorithm>
bool cmp(int aa, int bb)
{
return aa <= bb;
}
int main()
{
int n;
while(cin >> n)
{
int *ptr = new int[n];
for(int i = 0; i < n; i++)
cin >> ptr[i];
sort(ptr, ptr+n, cmp);
for(int j = 0; j < n-1; j++)
{
while(ptr[j] == ptr[j+1])
j++;
if(j != n-1)
cout << ptr[j] << " ";
}
cout << ptr[n-1];
cout << endl;
delete[] ptr;
}
return 0;
}
/**************************************************************
Problem: 1041
User: true14fans
Language: C++
Result: Accepted
Time:10 ms
Memory:1520 kb
****************************************************************/