标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7821 Accepted Submission(s): 3735
1 #include <cstdio> 2 #include <iostream> 3 #include <algorithm> 4 #include <cstring> 5 using namespace std; 6 int num[10010]; 7 int main() 8 { 9 int n; 10 while(~scanf("%d", &n)) 11 { 12 for(int i = 0; i < n; i++) 13 scanf("%d", &num[i]); 14 sort(num, num + n); 15 if(n & 1) 16 { 17 for(int j = 0, i = n-1; i > n/2; j++, i--) 18 printf("%d %d ", num[i], num[j]); 19 printf("%d\n", num[n/2]); 20 } 21 else 22 { 23 for(int j = 0, i = n-1; i >= n/2; j++, i--) 24 { 25 if(j == 0) 26 printf("%d %d", num[i], num[j]); 27 else 28 printf(" %d %d", num[i], num[j]); 29 } 30 printf("\n"); 31 } 32 } 33 34 return 0; 35 }
标签:
原文地址:http://www.cnblogs.com/fengshun/p/4725053.html