Codeforces 202(DIV2)A

来源:互联网 发布:java bloomfilter原理 编辑:程序博客网 时间:2024/06/09 14:24
#include<stdio.h>#include<stdlib.h>int a[101];int comp(const void *a,const void *b){return *(int *)a-*(int *)b;}int main(){int n,i;while(~scanf("%d",&n)){for(i = 0;i < n;i ++)scanf("%d",&a[i]);qsort(a,n,sizeof(a[0]),comp);printf("%d ",a[n-1]);for(i = 1;i < n-1;i ++)printf("%d ",a[i]);printf("%d\n",a[0]);}return 0;}


0 0