#include
#include
#define COUNT 10
int main()
{
int a[COUNT], count = COUNT, k, m, b[COUNT], t, c[COUNT];
printf("Input %d data in order:\n", COUNT);
for (k = 0; k < COUNT; k++)
{
printf("a[%d]=", k);
scanf("%d", &a[k]);
b[k] = a[k];
c[k] = a[k];
}
for (k = 0; k < COUNT - 1; k++)
for (m = k + 1; m < COUNT; m++)
if (c[k] > c[m])
{
t = c[k];
c[k] = c[m];
c[m] = t;
}
for (k = 0; k < COUNT; k++)
a[k] = c[k];
for (k = COUNT - 1; k > 0; k--)
if (a[k] == a[k - 1])
{
for (m = k - 1; m < COUNT - 1; m++)
a[m] = a[m + 1];
count--;
}
printf("原数组:");
for (k = 0; k < COUNT; k++)
printf("%d ", b[k]);
printf("\n");
printf("排序数组:");
for (k = 0; k < COUNT; k++)
printf("%d ", c[k]);
printf("\n");
printf("现数组");
for (k = 0; k < count; k++)
printf("%d ", a[k]);
printf("\n");
system("pause");
}