Codeforces Teams Forming (贪心)

                                                                                   B. Teams Forming

 

There are nn students in a university. The number of students is even. The ii-th student has programming skill equal to aiai.

The coach wants to form n2n2 teams. Each team should consist of exactly two students, and each student should belong to exactly one team. Two students can form a team only if their skills are equal (otherwise they cannot understand each other and cannot form a team).

Students can solve problems to increase their skill. One solved problem increases the skill by one.

The coach wants to know the minimum total number of problems students should solve to form exactly n2n2 teams (i.e. each pair of students should form a team). Your task is to find this number.

Input

The first line of the input contains one integer nn (2≤n≤1002≤n≤100) — the number of students. It is guaranteed that nn is even.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1001≤ai≤100), where aiai is the skill of the ii-th student.

Output

Print one number — the minimum total number of problems students should solve to form exactly n2n2teams.

Examples

input

Copy

6
5 10 2 3 14 5

output

Copy

5

input

Copy

2
1 100

output

Copy

99

Note

In the first example the optimal teams will be: (3,4)(3,4), (1,6)(1,6) and (2,5)(2,5), where numbers in brackets are indices of students. Then, to form the first team the third student should solve 11 problem, to form the second team nobody needs to solve problems and to form the third team the second student should solve 44 problems so the answer is 1+4=51+4=5.

In the second example the first student should solve 9999 problems to form a team with the second one.

 

题解 : 这是一道简单贪心,用优先队列做,题意是 , 有 n 名 学生 ,第 i 名学生的编程能力是 ai , 组建出n/2个队来, 每个队两个人,两个人的编程能力差距要尽可能小,队内的学生通过解决题目来缩小差距,使其队伍内的两个人编程能力一样. 

所以可以用优先队列模拟,先排序,相邻的两个人一定差距最小,然后两个两个的放入优先队列, 再出来n/2个 相加; 

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#define Swap(a,b)  a ^= b ^= a ^= b
using namespace std ;
const int MAX = 200;
const int inf = 0xffffff;
typedef long long LL;
priority_queue <int , g> q ;
int a[MAX] ;
int maxx = -1 ;

int main()
{
	int n  ;
	int sum = 0 ;
	int num  ;
	cin >> n ;
	num = n/2 ;
	for(int i = 1 ; i <=n ; i++)
	{
		cin >> a[i]  ;
	}
	sort(a+1,a+1+n) ;
	for(int i = 2 ; i<=n ;i+=2 )
	{
		int t = abs(a[i]-a[i-1]) ;
		q.push(t);
	}

	while(!q.empty() && num)
	{
		int t = q.top() ;
		cout<<t<<endl;
		sum+= t ;
		q.pop();
		num--;

	}
	cout<<sum <<endl ;

	return 0 ;
}