might have been a simple undertaking, yet it worked out that you ought to observe a few guidelines: Before all else, you select any sure integer x. Then, at that
Correct answer will be upvoted else downvoted. Computer science.
It might have been a simple undertaking, yet it worked out that you ought to observe a few guidelines:
Before all else, you select any sure integer x.
Then, at that point, you do the accompanying activity n times:
select two components of cluster with total equivalents x;
eliminate them from an and supplant x with limit of that two numbers.
For instance, if at first a=[3,5,1,2], you can choose x=6. Then, at that point, you can choose the second and the third components of a with total 5+1=6 and toss them out. After this activity, x equivalents 5 and there are two components in cluster: 3 and 2. You can toss them out on the following activity.
Note, that you pick x before the beginning and can't transform it as you need between the activities.
Decide how could you act to toss out all components of a.
Input
The main line contains a solitary integer t (1≤t≤1000) — the number of experiments.
The main line of each experiment contains the single integer n (1≤n≤1000).
The second line of each experiment contains 2n integers a1,a2,… ,a2n (1≤
It is ensured that the complete amount of n over all experiments doesn't surpass 1000.
Output
For each experiment in the primary line print YES in case it is feasible to toss out all components of the cluster and NO in any case.
In case it is feasible to toss out all components, print the underlying worth of x you've picked. Print depiction of n activities next. For every activity, print the pair of integers you eliminate.
Step by step
Solved in 4 steps with 1 images
