输入一个正整数 n (1<n<=10),再输入 n 个整数,将它们从大到小排序后输出

#include
#include
using namespace std;
int A[10];
int cmp(const void * a , const void * b)
{
return *(int*) a - *(int*)b;
}

int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
//
qsort(A , n , sizeof(int) , cmp);
for (int i= 0; i < n; i++)
cout << A[i] <return 0;
}

#include
int main(void)
{
int i,n,k,index,j;
int a[10];
printf("Input n:");
scanf("%d",&n);
printf("Input %d integers:",n);
for(i=0;i scanf("%d",&a[i]);
for(k=0;k index=k;
for(i=k+1;i if(a[i]>a[index]) index=i;
j=a[index];
a[index]=a[k];
a[k]=j;
}
printf("After sorted:");
for(i=0;i printf("%d",a[i]);
printf("\n");
return 0;
}