九度OJ1041-Simple Sorting【快排】

题目1041：Simple Sorting

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：4521

解决：1691

题目描述：

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年上海交通大学计算机研究生机试真题

 

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
int map[100000];
int f1(int x,int n)
{
	for(int i=0;i<n;i++)
	{
		if(map[i]==x)
		{
			return 0;
		}
	}
	return 1;
}
bool cmp(int x,int y)
{
	return x<y;
}
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int i,j=0;
		for(i=0;i<n;i++)
		{
			int aa;
			scanf("%d",&aa);
			if(f1(aa,j))
			{
				map[j++]=aa;
			}
		}
		sort(map,map+j,cmp);
		for(i=0;i<j;i++)
		{
			if(i==0)
			printf("%d",map[i]);
			else
			printf(" %d",map[i]);
		}

<span style="white-space:pre">		</span>printf("\n");
	} 
	return 0;
}