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?
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.
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".
4 1 2 2 1
1 2 1 2
5 1 3 2 2 5
1 5 2 3 2
题意就是,在奇数位上的数小于等于它左边的数,在偶数位上的数大于等于它左边的数,,,,也就是偶数位上的数大于或等于它两边的数
一个比较好的办法就是 先从小到大排序,,再把这组数分为大概的平均两部分,较小的数的部分大于或等于较大的数的部分,然后奇数位取前一部分 偶数位取后一部分,
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,a[1005],b[1005],z[1005];
int main()
{
int i,j,t=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
sort(a+1,a+1+n);
int x=1,y=(n+1)/2+1;
while(t!=n)
{
t++;
if(t%2==1)
z[t]=a[x++];
else
z[t]=a[y++];
}
for(i=1;i<=n;i++)
printf("%d ",z[i]);
printf("\n");
return 0;
}