B. Birthday

B. Birthday

http://codeforces.com/group/HD13CEfWEl/contest/239779/problem/B

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Cowboy Vlad has a birthday today! There are nn children who came to the celebration. In order to greet Vlad, the children decided to form a circle around him. Among the children who came, there are both tall and low, so if they stand in a circle arbitrarily, it may turn out, that there is a tall and low child standing next to each other, and it will be difficult for them to hold hands. Therefore, children want to stand in a circle so that the maximum difference between the growth of two neighboring children would be minimal possible.

Formally, let's number children from 11 to nn in a circle order, that is, for every ii child with number ii will stand next to the child with number i+1i+1, also the child with number 11 stands next to the child with number nn. Then we will call the discomfort of the circle the maximum absolute difference of heights of the children, who stand next to each other.

Please help children to find out how they should reorder themselves, so that the resulting discomfort is smallest possible.

Input

The first line contains a single integer nn (2≤n≤1002≤n≤100) — the number of the children who came to the cowboy Vlad's birthday.

The second line contains integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) denoting heights of every child.

Output

Print exactly nn integers — heights of the children in the order in which they should stand in a circle. You can start printing a circle with any child.

If there are multiple possible answers, print any of them.

Examples

input

Copy

5
2 1 1 3 2

output

Copy

1 2 3 2 1

input

Copy

3
30 10 20

output

Copy

10 20 30

Note

In the first example, the discomfort of the circle is equal to 11, since the corresponding absolute differences are 11, 11, 11 and 00. Note, that sequences [2,3,2,1,1][2,3,2,1,1] and [3,2,1,1,2][3,2,1,1,2] form the same circles and differ only by the selection of the starting point.

In the second example, the discomfort of the circle is equal to 2020, since the absolute difference of 1010 and 3030 is equal to 2020.

 

题意：

n个人，分别给出它们的高度。让他们围成一圈，使相邻两人高度差最小化。

输出一种情况即可。

思路：

那么一般单调递增的情况下最大值与最小值是不能排在一起的，那样的话这个方案的身高差就变大了，因此我们可以将相近的数分别放在其两边，这样处理的话就能够使其变得最小。

在这里我们用STL里面的双端队列去处理这个序列，先让最小的 a[1] 入队,

那么 a[2]、a[3] 分别在其两侧……依次类推

 

代码：

#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;

deque<int>q;
int s[105];

int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>s[i];
    sort(s+1,s+n+1);
    for(int i=1;i<=n;i++)
    {
        if(i&1)
            q.push_front(s[i]);
        else
            q.push_back(s[i]);
    }
    for(int i=0;i<n-1;i++)
        cout<<q[i]<<" ";
    cout<<q[n-1]<<endl;
    return 0;
}