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
- Codeforces 202(DIV2)A
- Codeforces-273(div2) A. Initial Bet
- Codeforces #353 (div2)A. Infinite Sequence
- 【codeforces div2 A】Calculating Function(思维)
- codeforces 105 div2 A
- codeforces 145 div2 A
- CODEFORCES #339 div2 A
- codeforces div2 round#231 A
- codeforces div2 round#230 A
- Codeforces #261 div2 A 题
- CodeForces #317 (div2) A.Arrays
- codeforces#336 div2 A,B
- Codeforces #398 div2 A-D
- codeforces Round 411 div2 A
- Codeforces Round #376A (div2)
- codeforces 428(div2) A-D
- codeforces#259 div2 (a,b,c)三题
- Codeforces Round #265 (div2) A. inc ARG
- HDU 1102
- 大学感想
- HDU 1049
- HDU 2571
- Codeforces 201(DIV2)B
- Codeforces 202(DIV2)A
- HDU 1062
- HDU 1061
- HDU 2037
- HDU 2082
- Linux 下 vim/Gvim配置
- HDU 3790
- HDU 1312
- HDU 1241