AcWing 5065. 排序去重
原题链接
简单
作者:
xiaying
,
2023-10-06 20:08:37
,
所有人可见
,
阅读 67
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010;
int a[N];
void quick_sort(int a[], int l, int r)
{
if (l >= r) return ;
int x = a[(l + r) >> 1];
int i = l - 1, j = r + 1;
while (i < j)
{
do i ++ ; while (a[i] < x);
do j -- ; while (a[j] > x);
if (i < j) swap(a[i], a[j]);
}
quick_sort(a, l, j);
quick_sort(a, j + 1, r);
}
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
// sort(a, a + n);
quick_sort(a, 0, n - 1);
for (int i = 0; i < n; i ++ ) printf("%d ", a[i]);
printf("\n");
int i = 0, j = 0;
while (j < n)
{
while (a[i] == a[j]) j ++ ;
if (j < n)
a[++ i] = a[j ++ ];
}
for (int k = 0; k <= i; k ++ ) printf("%d ", a[k]);
return 0;
}