Cow Blankets It's winter again, and it is so terribly cold that Farmer John feels obligated to do something to make his N (1 <= N <= 20,000) cows warmer. FJ has managed to uncover from his stockpiles a total of K (N <= K <= 50,000) blankets. After careful experimentation, FJ has determined the coldness of each of the cows' sleeping places in the barn in addition to how warm each blanket is. Farmer John knows that a cow whose temperature isn't correct is unhappy. As a conscientious farmer, FJ wants to ensure that no cow is unnecessarily unhappy. FJ quantifies the a cow's unhappiness as follows: cow i in a part of the barn with coldness C_i (0 <= C_i <= 1,000,000) using a blanket with warmth W_j (1 <= W_j <= 1,000,000) has unhappiness |W_j - C_i|. Help FJ achieve his dream by giving some cows blankets so that the maximum unhappiness in his herd is minimized. If FJ does not give a cow a blanket, the cow's unhappiness is simply C. Find a way to distribute the blankets such that the least happy cow's unhappiness is minimized. PROBLEM NAME: cowblank INPUT FORMAT: * Line 1: Two space-separated integers: N and K. * Lines 2..N+1: Line i+1 contains a single integer: C_i. * Lines N+2..N+K+1: Line N+1+j contains a single integer: W_j. SAMPLE INPUT: 5 7 3 6 7 8 15 2 9 3 11 12 13 20 OUTPUT FORMAT: * Line 1: One integer, the smallest possible value of the maximum of |W - C| over all cows. SAMPLE OUTPUT: 3 OUTPUT DETAILS: Cow 3 gets no blanket, 6 with 3, 7 with 9, 8 with 11, and 15 with 13.