{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv id\u003d\"problem-body\"\u003e\n \u003cp\u003emr Ahmed make exam in class, with N (2 \u0026lt;\u003d N \u0026lt;\u003d 100,000) seats. The seats are located along a straight line at positions x1 ... xN (0 \u0026lt;\u003d xi \u0026lt;\u003d 1,000,000,000).\u003cbr\u003e\u003cbr\u003e\n class contains S(2 \u0026lt;\u003d S \u0026lt;\u003d N) Students . To prevent the cheating, mr Ahmed wants to assign the Student to the seats, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?\u003cbr\u003e\u003c/p\u003e\n \u003ch3\u003eInput\u003c/h3\u003e\n \u003cp\u003e\u003ci\u003et\u003c/i\u003e – the number of test cases, then \u003ci\u003et\u003c/i\u003e test cases follows. \u003cbr\u003e\n - Line 1: Two space-separated integers: N and S\u003cbr\u003e\n - Lines 2..N+1: Line i+1 contains an integer seat location, xi\u003cbr\u003e\u003c/p\u003e\n \u003ch3\u003eOutput\u003c/h3\u003e\n \u003cp\u003eFor each test case output one integer: the largest minimum distance.\u003cbr\u003e\u003c/p\u003e\n \u003ch3\u003eExample\u003c/h3\u003e\n \u003cp\u003e\u003cb\u003eInput:\u003c/b\u003e\u003c/p\u003e\n \u003cpre\u003e\n1\n5 3\n1\n2\n8\n4\n9\n\u003c/pre\u003e\n \u003cp\u003e\u003cb\u003eOutput:\u003c/b\u003e\u003c/p\u003e\n \u003cpre\u003e\n3\n\u003c/pre\u003e\n \u003cp\u003e\u003cb\u003eOutput details:\u003c/b\u003e\u003c/p\u003e\n \u003cp\u003emr ahmed can put his 3 Students in the seats at positions 1, 4 and 8, \u003cbr\u003e\n resulting in a minimum distance of 3.\u003cbr\u003e\u003c/p\u003e\n\u003c/div\u003e"}}]}