CF652B.z-sort

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

A student of zz -school found a kind of sorting called zz -sort. The array aa with nn elements are zz -sorted if two conditions hold:

  1. ai>=ai1a_{i}>=a_{i-1} for all even ii ,
  2. ai<=ai1a_{i}<=a_{i-1} for all odd i>1 .

For example the arrays [1,2,1,2] and [1,1,1,1] are zz -sorted while the array [1,2,3,4] isn’t zz -sorted.

Can you make the array zz -sorted?

输入格式

The first line contains a single integer nn ( 1<=n<=10001<=n<=1000 ) — the number of elements in the array aa .

The second line contains nn integers aia_{i} ( 1<=ai<=1091<=a_{i}<=10^{9} ) — the elements of the array aa .

输出格式

If it's possible to make the array aa zz -sorted print nn space separated integers aia_{i} — the elements after zz -sort. Otherwise print the only word "Impossible".

输入输出样例

  • 输入#1

    4
    1 2 2 1
    

    输出#1

    1 2 1 2
    
  • 输入#2

    5
    1 3 2 2 5
    

    输出#2

    1 5 2 3 2
    
首页