[CodeForces - 652B] B. z-sort

最新推荐文章于 2024-07-15 17:55:50 发布

原创最新推荐文章于 2024-07-15 17:55:50 发布 · 394 阅读

0 ·

CC 4.0 BY-SA版权

周练专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种名为Z-Sort的特殊排序算法，该算法要求数组中的元素在偶数位置递增，在奇数位置递减。文章通过示例展示了如何实现Z-Sort，并提供了一段C++代码作为实现参考。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Link：http://codeforces.com/problemset/problem/652/B

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

ai ≥ ai - 1 for all even i,
ai ≤ ai - 1 for all odd i > 1.

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

Can you make the array z-sorted?

Input

The first line contains a single integer n (1 ≤ n ≤ 1000) — the number of elements in the array a.

The second line contains n integers ai (1 ≤ ai ≤ 109) — the elements of the array a.

Output

If it's possible to make the array a z-sorted print n space separated integers ai — the elements after z-sort. Otherwise print the only word "Impossible".

   Examples
 
     input
   
4
1 2 2 1

     output
   
1 2 1 2

     input
   
5
1 3 2 2 5

     output
   
1 5 2 3 2

Code:

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
using namespace std;
int a[1005],b[1005];
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		for(int i=1;i<=n;i++)
			scanf("%d",&a[i]);
		int k=1;
		sort(a+1,a+1+n);
		for(int i=1;i<=n;i+=2)
			b[i]=a[k++];  //所有奇数位上的数都小于上一个数
		for(int i=2;i<=n;i+=2)
			b[i]=a[k++];  //所有偶数位上的数都大于上一个数
		for(int i=1;i<=n;i++)
			printf("%d%c",b[i],i==n? '\n':' ');
	}
return 0;
}