HDU 2673 shǎ崽 OrOrOrOrz（格式控制很重要）

shǎ崽 OrOrOrOrz

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10095    Accepted Submission(s): 4645

Problem Description

Acmer in HDU-ACM team are ambitious, especially shǎ崽, he can spend time in Internet bar doing problems overnight. So many girls want to meet and Orz him. But Orz him is not that easy.You must solve this problem first.
The problem is :
Give you a sequence of distinct integers, choose numbers as following : first choose the biggest, then smallest, then second biggest, second smallest etc. Until all the numbers was chosen . 
For example, give you 1 2 3 4 5, you should output 5 1 4 2 3

Input

There are multiple test cases, each case begins with one integer N(1 <= N <= 10000), following N distinct integers.

Output

Output a sequence of distinct integers described above.

Sample Input

5 1 2 3 4 5

Sample Output

5 1 4 2 3

 

/*
	做的时候一直Presentation Error，格式错误，注意最后的一个输出不带空格
*/
#include<iostream>
#include<algorithm>
using namespace std;


int main()
{
	int n, num[10000];
	while (cin >> n)
	{
		for (int i = 0; i < n; i++)
		{
			cin >> num[i];
		}
		sort(num, num + n);
		for (int i = 0, j = n - 1; i < ( n + 1 )/2 - 1; i++, j--)	//偶数个还剩中间2个，奇数个还剩中间一个
		{
			cout << num[j] << " " << num[i] << " ";
		}
		if (n % 2 == 0)
			cout << num[n / 2] << " " << num[n / 2 - 1];
		else
			cout << num[n / 2];	
		cout << endl;
	}
	return 0;
}