Educational Codeforces Round 118 (Rated for Div. 2) B. Absent Remainder

题目链接：Problem - B - Codeforces

You are given a sequence a1,a2,…,an consisting of nn pairwise distinct positive integers.

Find ⌊n/2⌋ different pairs of integers x and y such that:

• x≠y;
• x and y appear in a;
• x mod y doesn't appear in a.

Note that some x or y can belong to multiple pairs.

⌊x⌋ denotes the floor function — the largest integer less than or equal to x. x mod y denotes the remainder from dividing x by y.

If there are multiple solutions, print any of them. It can be shown that at least one solution always exists.

Input

The first line contains a single integer tt (1≤t≤104) — the number of testcases.

The first line of each testcase contains a single integer nn (2≤n≤2⋅105) — the length of the sequence.

The second line of each testcase contains nn integers a1,a2,…,an(1≤ai≤106).

All numbers in the sequence are pairwise distinct. The sum of nn over all testcases doesn't exceed 2⋅105.

Output

The answer for each testcase should contain ⌊n/2⌋ different pairs of integers x and y such that x≠y, x and y appear in aa and x mod y doesn't appear in a. Print the pairs one after another.

You can print the pairs in any order. However, the order of numbers in the pair should be exactly such that the first number is x and the second number is y. All pairs should be pairwise distinct.

If there are multiple solutions, print any of them.

Example

input

Copy

4
2
1 4
4
2 8 3 4
5
3 8 5 9 7
6
2 7 5 3 4 8

output

Copy

4 1
8 2
8 4
9 5
7 5
8 7
4 3
5 2

Note

In the first testcase there are only two pairs: (1,4) and (4,1). ⌊2/2⌋=1, so we have to find one pair. 1 mod 4=1, and 11 appears in aa, so that pair is invalid. Thus, the only possible answer is a pair (4,1).

In the second testcase, we chose pairs 8 mod 2=0 and 8 mod 4=0. 0 doesn't appear in aa, so that answer is valid. There are multiple possible answers for that testcase.

In the third testcase, the chosen pairs are 9 mod 5=4 and 7 mod 5=2. Neither 4, nor 2, appears in a, so that answer is valid.

题意：从a序列中任选两个不相同的数，让模数不出现在序列里面

思路：把所有数存map里面，然后遍历两遍map，找出符合条件的n/2对

#include<bits/stdc++.h>
using namespace std;
map<int, int> mp;
 
int main(){
	ios::sync_with_stdio(false);
	int t;
	cin >> t;
	int n;
	int a;
	while(t--){
		cin >> n;
		int m = n / 2; 
		mp.clear();
		for(int i = 0; i < n; i++){
			cin >> a;
			mp[a]++;	
		}
		bool flag = 0;
		for(auto i : mp){
			for(auto l : mp){
				if(!mp.count(l.first % i.first)){
					if(i.first == l.first){
						continue;
					}
					cout << l.first << " " << i.first << endl;
					m -= i.second * l.second;
					if(m <= 0){
						flag = 1;
						break;
					}
				}
			}
			if(flag){
				break;
			}
		}
	}
	return 0;
}