{"problem":{"name":"Min Difference","description":{"content":"You are given two sequences: $A=(A_1,A_2, \\ldots ,A_N)$ consisting of $N$ positive integers, and $B=(B_1, \\ldots ,B_M)$ consisting of $M$ positive integers. Find the minimum difference of an element o","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc212_c"},"statements":[{"statement_type":"Markdown","content":"You are given two sequences: $A=(A_1,A_2, \\ldots ,A_N)$ consisting of $N$ positive integers, and $B=(B_1, \\ldots ,B_M)$ consisting of $M$ positive integers.\nFind the minimum difference of an element of $A$ and an element of $B$, that is, $\\displaystyle \\min_{ 1\\leq i\\leq N}\\displaystyle\\min_{1\\leq j\\leq M} \\lvert A_i-B_j\\rvert$.\n\n## Constraints\n\n*   $1 \\leq N,M \\leq 2\\times 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n*   $1 \\leq B_i \\leq 10^9$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n$B_1$ $B_2$ $\\ldots$ $B_M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc212_c","tags":[],"sample_group":[["2 2\n1 6\n4 9","2\n\nHere is the difference for each of the four pair of an element of $A$ and an element of $B$: $\\lvert 1-4\\rvert=3$, $\\lvert 1-9\\rvert=8$, $\\lvert 6-4\\rvert=2$, and $\\lvert 6-9\\rvert=3$. We should print the minimum of these values, or $2$."],["1 1\n10\n10","0"],["6 8\n82 76 82 82 71 70\n17 39 67 2 45 35 22 24","3"]],"created_at":"2026-03-03 11:01:13"}}