题解 | #Simple Sorting#

#include <iostream>
#include <cstring> 
#include <algorithm>
#include <math.h>
#include <string.h> 
#include <stdlib.h>
using namespace std;
#define MAX 1001
int main(){
	int n;
	cin >> n ;
	int a[MAX];

	for (int i = 0; i < n; i++)
		cin >> a[i];

	sort(a,a+n);
	int j, k;
	for(int i = 0; i < n; i++){
		if (a[i] == a[i+1]){
			j = i+1;
			while(a[j] == a[i]) j++;	//找到i之后第一个不等于a[i]的值
			for(k = i+1; j < n; k++){
				a[k] = a[j++];
			}
		}
		n = k;	
	}
	for (int i = 0; i < n; i++)
		cout<<a[i]<<" ";
}