C. Challenging Cliffs

time limit per test

2 seconds

memory limit per test

256 megabytes

You are a game designer and want to make an obstacle course. The player will walk from left to right. You have n heights of mountains already selected and want to arrange them so that the absolute difference of the heights of the first and last mountains is as small as possible.

In addition, you want to make the game difficult, and since walking uphill or flat is harder than walking downhill, the difficulty of the level will be the number of mountains i (1≤i<n) such that hi≤hi+1 where hi is the height of the i-th mountain. You don't want to waste any of the mountains you modelled, so you have to use all of them.

From all the arrangements that minimize |h1−hn|, find one that is the most difficult. If there are multiple orders that satisfy these requirements, you may find any.

Input

The first line will contain a single integer t (1≤t≤100) --- the number of test cases. Then t test cases follow.

The first line of each test case contains a single integer n (2≤n≤2⋅105) --- the number of mountains.

The second line of each test case contains n integers h1,...,hn (1≤hi≤109), where hi is the height of the i-th mountain.

It is guaranteed that the sum of n over all test cases does not exceed 2⋅105.

Output

For each test case, output n integers --- the given heights in an order that maximizes the difficulty score among all orders that minimize |h1−hn|.

If there are multiple orders that satisfy these requirements, you may output any.

Example

Input

Copy

复制代码
2
4
4 2 1 2
2
3 1

Output

Copy

复制代码
2 4 1 2 
1 3

Note

In the first test case:

The player begins at height 2, next going up to height 4 increasing the difficulty by 1. After that he will go down to height 1 and the difficulty doesn't change because he is going downhill. Finally the player will go up to height 2 and the difficulty will increase by 1. The absolute difference between the starting height and the end height is equal to 0 and it's minimal. The difficulty is maximal.

In the second test case:

The player begins at height 1, next going up to height 3 increasing the difficulty by 1. The absolute difference between the starting height and the end height is equal to 2 and it's minimal as they are the only heights. The difficulty is maximal.

解题说明:此题是一道模拟题,采用贪心算法, 首先从小到大排序后找到2个下标x,y 使得abs(h[x]-h[y])最小 ,可以发现 1 <= i < x 时 h[i] <= h[i+1] y <= i < n 时h[i] <= h[i+1] 所以把y到n中的数放前面 把1到x中的数放后面 当h[1]!=h[n]的时候 h[i] <= h[i+1]的i的个数最大为n-2 ,当h[1]==h[n]的时候 为n-1。

cpp 复制代码
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
	int t, n, i; 
	cin >> t;
	while (t--)
	{
		cin >> n; 
		int a[n], m = INT_MAX, j;
		for (i = 0; i < n; i++)
		{
			cin >> a[i];
		}
		sort(a, a + n);
		for (i = 1; i < n; i++) 
		{
			if (a[i] - a[i - 1] < m)
			{
				m = a[i] - a[i - 1];
				j = i;
			}
		} 
		cout << a[j - 1] << " ";
		for (i = j + 1; i < n; i++)
		{
			cout << a[i] << " ";
		}
		for (i = 0; i < j - 1; i++)
		{
			cout << a[i] << " ";
		}
		cout << a[j] << endl;
	}
	return 0;
}
相关推荐
fs哆哆4 小时前
在VB.net中一维数组,与VBA有什么区别
java·开发语言·数据结构·算法·.net
johnZhangqi4 小时前
深圳大学-计算机信息管理课程实验 C++ 自考模拟题
java·开发语言·c++
Sally璐璐5 小时前
Go语言变量声明与初始化详解
java·开发语言·golang
luofeiju5 小时前
交叉编译笔记
开发语言
StudyWinter6 小时前
【C++】仿函数和回调函数
开发语言·c++·回调函数·仿函数
C4程序员6 小时前
北京JAVA基础面试30天打卡14
java·开发语言·面试
黑客影儿6 小时前
Go特有的安全漏洞及渗透测试利用方法(通俗易懂)
开发语言·后端·安全·web安全·网络安全·golang·系统安全
你好,我叫C小白7 小时前
C语言 常量,数据类型
c语言·开发语言·数据类型·常量
小红帽2.07 小时前
从ioutil到os:Golang在线客服聊天系统文件读取的迁移实践
服务器·开发语言·golang
Zafir20248 小时前
Qt实现TabWidget通过addTab函数添加的页,页内控件自适应窗口大小
开发语言·c++·qt·ui