Stepan - businessman
Uzhlandia is renowned for its thriving trade relations.
Stepan has decided to venture into trading computer equipment to earn some money for his vacation. To do this, he plans to purchase equipment from other sellers. Before diving into the business, he wants to analyze the market in Uzhlandia to determine how to maximize his profit.
Stepan discovered that each seller offers one computer, and each buyer is interested in purchasing exactly one computer. There are N sellers in the market, with the i-th seller pricing their computer at A_i Uzhlandian coins. The prices vary among sellers. Additionally, there are M potential buyers, each willing to pay B_i coins for a computer. Stepan can buy and sell any number of computers.
Stepan's goal is to achieve the highest possible profit by buying low and selling high. He has turned to you for assistance, as you are the best programmer in Uzhlandia.
**Input Format:** The first line of the input contains two integers N, M (1 ≤ N, M ≤ 10^5) separated by a space, representing the number of sellers and the number of potential buyers, respectively. The second line contains N integers A_i (0 ≤ A_i ≤ 10^9), which are the prices at which sellers are willing to sell computers. The third line contains M integers B_i (0 ≤ B_i ≤ 10^9), which are the amounts potential buyers are willing to pay for a computer.
**Output Format:** The output should be a single integer S, representing the maximum profit in coins that Stepan can achieve.
**Explanation of Examples:**
In the first example, Stepan buys computers from the 1st and 2nd sellers and sells them to any two buyers. In the second example, it is most profitable for Stepan to buy computers from the 1st, 4th, and 6th sellers and sell them to the 3rd, 4th, and 5th buyers.