SwustOj A simple problem(0093)

Dreamone has a lovely cat. The cat can comfort you if you are very dejected, she can also play with you if you are very bored. So Dreamone loves her very much. Of course, you bet, she can also make you trouble if she wants to be naughty. This time, she comes up with a simple problem for fun, just like this: She has 2n toys. In her heart, she has used a number to stand for each toy, and for example, the 2n toys are given like this: A1、A2、A3、….A2n-1、A2n She wants to divide them into two groups, where each group contains n toys. So we can use B1、B2...Bn ,which are all from A1、A2...A2n ,to stand for Group One ,use C1、C2….Cn ,which are all from A1、A2...A2n, to stand for Group Two. The cat wants to know the minimum value S for the expression below: S=|B1-C1|+|B2-C2|+|B3-C3|+...+|Bn-Cn| As we know Dreamone is studying MaJiang recently, so he has no time to solve the simply problem. But he knows the 6th program contest of SWUST is on, so he turns to you for help. Can you help him?

Description

The first line of input will be a positive integer C indicating how many data sets will be included. Each of the C data sets will contain two parts：The first part contains a number n(1<=n<=100000),and the second parts contains 2n numbers ,which are A1、A2、A2n-1、A2n (0<=Ai<=1000(1<=i<=2n)),represented 2n toys

Input

For each case, output the minimum value S for answer.

Output

1 2 3 4 5

2 1 1 3 2 1 1 1 2

Sample Input

1 2

2 1

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
int a[200005];
int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		n *= 2;
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
		}
		sort(a, a + n);
		int ans = 0;
		for (int i = 0; i < n; i+=2)
		{
			ans += abs(a[i] - a[i + 1]);
		}
		cout << ans << endl;
	}
	return 0;
}