ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs
Login Register

5612: his brother

内存限制：256 MB 时间限制：1 S 标准输入输出
题目类型：传统 评测方式：文本比较 上传者：
提交：20 通过：14
提交提交记录统计Web Board

题目描述


  德夫和他的兄弟非常相爱。由于他们是超级极客，他们只喜欢玩阵列。他们的父亲给了他们两个数组a和b。数组a给了Devu，数组b给了他的兄弟。
  因为Devu真的是一个淘气的孩子，他希望他的数组a的最小值至少和他兄弟的数组b的最大值一样多。
  现在你必须帮助Devu达到这个条件。您可以对阵列执行多个操作。在一次操作中，允许将任意数组的任何元素减少或增加1。请注意，允许对数组的任何索引多次应用该操作。
  你需要找到满足Devu条件所需的最少操作次数，这样兄弟们就可以在没有战斗的情况下和平玩耍。 



Devu and his brother love each other a lot. As they are super geeks, they only like to play with arrays. They are given two arrays a and b by their father. The array a is given to Devu and b to his brother.
As Devu is really a naughty kid, he wants the minimum value of his array a should be at least as much as the maximum value of his brother's array b.
Now you have to help Devu in achieving this condition. You can perform multiple operations on the arrays. In a single operation, you are allowed to decrease or increase any element of any of the arrays by 1. Note that you are allowed to apply the operation on any index of the array multiple times.
You need to find minimum number of operations required to satisfy Devu's condition so that the brothers can play peacefully without fighting.

Input
The first line contains two space-separated integers n, m (1≤n,m≤105). The second line will contain n space-separated integers representing content of the array a (1≤ai≤109). The third line will contain m space-separated integers representing content of the array b (1≤bi≤109).
Output
You need to output a single integer representing the minimum number of operations needed to satisfy Devu's condition.
Examples
Input 
2 2
2 3
3 5
Output 
3
Input 
3 2
1 2 3
3 4
Output 
4
Input 
3 2
4 5 6
1 2
Output 
0
Note
In example 1, you can increase a1 by 1 and decrease b2 by 1 and then again decrease b2 by 1. Now array a will be [3; 3] and array b will also be [3; 3]. Here minimum element of a is at least as large as maximum element of b. So minimum number of operations needed to satisfy Devu's condition are 3.
In example 3, you don't need to do any operation, Devu's condition is already satisfied.

输入格式

第一行包含两个用空格分隔的整数 n, m (1≤n,m≤105).第二行包含n个用空格分隔的整数，表示数组a (1≤ai≤109)的内容。第三行包含m个用空格分隔的整数，表示数组b (1≤bi≤109)的内容。

输出格式

您需要输出一个整数，表示满足Devu条件所需的最小操作数。

Input 
2 2
2 3
3 5
Output 
3
Input 
3 2
1 2 3
3 4
Output 
4
Input 
3 2
4 5 6
1 2
Output 
0
解释

在示例1中，可以将a1增加1，将b2减少1，然后将b2再次减少1。现在数组a将为 [3; 3]，数组b也将为 [3; 3]。这里，a的最小元素至少和b的最大元素一样大。因此，满足Devu条件所需的最小操作数为3。 
在示例3中，您不需要执行任何操作，Devu的条件已经满足。 



输入样例 复制 

2 2
2 3
3 5

输出样例 复制 

3

数据范围与提示

在示例1中，可以将a1增加1，将b2减少1，然后将b2再次减少1。现在数组a将为 [3; 3]，数组b也将为 [3; 3]。这里，a的最小元素至少和b的最大元素一样大。因此，满足Devu条件所需的最小操作数为3。
在示例3中，您不需要执行任何操作，Devu的条件已经满足。

分类标签