Codeforces 202(DIV2)A
2014-04-30 18:35
344 查看
#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; }
相关文章推荐
- Codeforces 202(DIV2)A
- CodeForces 827C Round#423 Div2E&Div1C Solution:树状数组或其他
- Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals) Problem E (Codeforces 831E) - 线段树 - 树状数组
- Codeforces 424 div1 C. Bamboo Partition 830C 分块优化
- 【codeforces】Codeforces Round #278 (Div. 1) 题解
- codeforces 286 div2 B
- Codeforces Round #202 (Div. 2) B. Color the Fence
- Codeforces 592 A. PawnChess 【Codeforces Round #328 (Div. 2)】
- codeforces基础题——#362(div2)D
- 第二十三次codeforces竞技结束 #279 Div 2
- codeforces 388 div2 749B - Parallelogram is Back
- [杂题] Codeforces 830C Round #424 Div1 C. Bamboo Partition
- Codeforces 716A Crazy Computer 【模拟】 (Codeforces Round #372 (Div. 2))
- Codeforces 311(div 2):E. Ann and Half-Palindrome
- 【codeforces】Codeforces Round #284 (Div. 1) 【题解】
- CodeForces 653 A. Bear and Three Balls——(IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2))
- 【codeforces 】Educational Codeforces Round 36 (Rated for Div. 2)(C.模拟 D.拓扑排序判断环)
- Codeforces Round #202 (Div. 2) D. Apple Tree (DFS + Math)
- 第七次codeforces竞技结束 #258 Div 2
- 【codeforces】Codeforces Round #370 (Div. 2) C